Abstract
In this paper, the Broyden class of quasi-Newton methods for unconstrained optimization is investigated. Non-monotone linesearch procedure is introduced, which is combined with the Broyden's class. Under the convexity assumption on objective function, the global convergence of the Broyden's class is proved.
Similar content being viewed by others
References
Byrd, R.H., Liu, D.C, Nocedal, J. On the behavior of Broyden's class of quasi-Newton methods. Technical Report NAM 01, Department of Electrical Engineering and Computer Science, North-Western University, 1990
Byrd, R.H., Nocedal, J. A tool for the analysis of quasi-Newton methods with application to unconstrained minimization. SIAM Journal on Numerical Analysis, 26: 727–739 (1989)
Byrd, R.H., Nocedal, J., Yuan, Y. Global convergence of a class of quasi-Newton methods on convex problems. SIAM Journal on Numerical Analysis, 24: 1171–1189 (1987)
Dennis, Jr.J.E., Mor´e, J.J. Quasi-Newton method, motivation and theory. SIAM Review, 19: 46–89 (1977)
Fletcher, R. Practical method of optimization, 2nd ed. John Wiley & Sons, New York, 1987
Grippo, L., Lampariello, F., Lucidi, S. A nonmonotone line search technique for Newton's method. SIAM Journal on Numerical Analysis, 23: 707–716 (1986)
Han, J.Y., Liu, G.H. Global convergence analysis of a new non-monotone BFGS algorithm on convex objective functions. Computational Optimization and Applications, 7: 277–289 (1997)
Ke, X.W. Convergence of the preconvex part of Broyden's family. Jouranl of Beijing Normal University, 31(1): 6–10 (1995)
Liu, G.H., Han, J.Y, Sun, D.F. Global convergence of the BFGS algorithm with non-monotone linesearch. Optimizition, 34: 147–159 (1995)
Pearson, J.D. Variable metric methods of minimization. The Computer Journal, 12: 171–178 (1969)
Powell, M.J.D. Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In: Cottle, R.W., Lemke, C.E. eds., Nonlinear Programming, SIAM-AMS Proceeding Vol. IX, SIAM publications, Philadelphia, 1997, 53–72
Toint, Ph.L. A non-monotone trust region algorithm for nonlinear optimization subject to convex constraints. Mathematical Programming, 77: 69–94 (1997)
Yuan, Y. Numerical methods for nonlinear programming. Shanghai Scientific and Technical Publishers, Shanghai, 1993 (in Chinese)
Zhang, Y., Tewarson, R.P. Quasi-Newton algorithms with updates from the preconvex part of Broyden's family. IMA Journal on Numerical Analysis, 8: 487–509 (1988)
Author information
Authors and Affiliations
Corresponding author
Additional information
Partly supported by the National Natural Sciences Foundation of China (No. 19731001), Natural 973 Information Technology and High-Performance Software Program of China (No. G1998030401) and K. C. Wong Education Foundation, Hong Kong.
Rights and permissions
About this article
Cite this article
Xu, Dc. Global Convergence of the Broyden's Class of Quasi-Newton Methods with Nonmonotone Linesearch. Acta Mathematicae Applicatae Sinica, English Series 19, 19–24 (2003). https://doi.org/10.1007/s10255-003-0076-4
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10255-003-0076-4