Abstract
A general nonmonotone trust region method with curvilinear path for unconstrained optimization problem is presented. Although this method allows the sequence of the objective function values to be nonmonotone, convergence properties similar to those for the usual trust region methods with curvilinear path are proved under certain conditions. Some numerical results are reported which show the superiority of the nonmonotone trust region method with respect to the numbers of gradient evaluations and function evaluations.
Zusammenfassung
Es wird ein allgemeines nichtmonotones Konfidenzbereichs-Verfahren mit krummlinigem Pfad für die unrestringierte Optimierung vorgeschlagen. Obwohl bei diesem Verfahren die Folge der Werte der Objecktfunktion nicht monoton zu sein braucht, werden Konvergenzeigenschaften bewiesen, die denen der gängigen Verfahren dieser Art entsprechen. An Hand einiger numerischer Beispiele wird die Über-legenheit des nichtmonotonen Verfahrens bezüglich der Zahl der Gradienten- und der Funktions-auswertungen gezeigt.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Bulteau, J. P., Vial, J. P.: Curvilinear path and trust region in unconstrained optimization: a convergence analysis. Math. Programming Study30, 82–101 (1987).
Chamberlain, R. M., Powell, M. J. D., Lemarechal, C., Pedersen, H. C.: The watchdog technique for forcing convergence in algorithms for constrained optimization. Math. Programming Study26, 1–17 (1986).
Dennis, J. E., Jr., Mei, H. H. W.: Two new unconstrained optimization algorithms which use function and gradient values. JOTA28, 453–482 (1979).
Dennis, J. E., Jr., Schnabel, R. B.: Numerical methods for unconstrained optimization and nonlinear equations. Englewood Cliffs, New York: Prentice-Hall 1983.
Gan, Z., Zhou, F., Xiao, Y.: Study on the algorithm for multidimensional scaling. J. of Tsinghua Univ.31, 6, 20–27 (1991).
Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton's methods. SIAM J. Numer. Anal.23, 707–716 (1986).
Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained optimization. JOTA60, 401–419 (1989).
Grippo, L., Lampariello, F., Lucidi, S.: A quasi-discrete Newton algorithm with a nonmonotone stabilization technique. JOTA64, 495–510 (1990).
Grippo, L., Lampariello, F., Lucidi S.: A class of nonmonotone stabilization methods in unconstrained optimization, IASI-CNR, Report No. 290, 1990.
Moré, J. J.: Recent development in algorithms and software for trust region methods, pp. 258–287 In: Bachem, A., Grotschel, M., Kortz, B. (eds.) Mathematical Programming: the state of the art. Berlin, Heidelberg, New York, Tokyo: Springer 1983.
Moré, J. J., Sorensen, D. C.: Computing a trust region step. SIAM J. Sci. Statist. Comput.4, 553–572 (1983).
Panier, E. R., Tits, A. L.: Avoiding the Maratos effect by means of a nonmonotone linear search: I. General constrained problems System Research Center, University of Maryland, Technical Report SRC-TR-89-41, 1989.
Powell, M. J. D.: A hybrid method for nonlinear equations, pp. 87–114. Babinowitz, P., (ed.) Numerical methods for nonlinear algebraic equations. London: Gordon and Breach Press 1970.
Powell, M. J. D.: Convergence properties of a class of minimization algorithms, pp. 1–29. In: Mangasarian, O. L., Meyer, R. R., Robinson, S. M. (eds) Nonlinear programming 2. New York: Academic Press 1975.
Shultz, G. A., Schnabel, R. B., Byrd, R. H.: A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties. SIAM J. Numer. Anal.22, 47–67 (1985).
Sorensen, D. C.: Trust region methods for unconstrained minimization, pp. 29–38. In: Powell, M. J. D. (ed.) Nonlinear optimization 1981. London: Academic Press 1982.
Sorensen, D. C.: Newton's method with a model trust region modification. SIAM J. Numer. Anal.19, 409–426 (1982).
Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal.20, 626–637 (1983).
Author information
Authors and Affiliations
Additional information
This work, in part was supported by the Natural Science Foundation of Tsinghua University.
Rights and permissions
About this article
Cite this article
Xiao, Y., Zhou, F. Nonmonotone trust region methods with curvilinear path in unconstrained optimization. Computing 48, 303–317 (1992). https://doi.org/10.1007/BF02238640
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02238640