Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch

Acta Mathematicae Applicatae Sinica

Volumn 19, Issue 1, 2003, Pages 19-24

  Xu, Da Chuan ^a  

^a INSTITUTE OF APPLIED MATHEMATICS   (China)

Author keywords

Broyden class; Global convergence; Non monotone linesearch; Quasi Newton method; Unconstrained optimization

Indexed keywords

EID: 33846904153     PISSN: 01689673     EISSN: 16183932     Source Type: Journal    
DOI: 10.1007/s10255-003-0076-4     Document Type: Article

References (14)

1. 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
2. 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)
3. 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)
4. Dennis, Jr.J.E., Moré, J.J. Quasi-Newton method, motivation and theory. SIAM Review, 19: 46-89 (1977)
5. Fletcher, R. Practical method of optimization, 2nd ed. John Wiley & Sons, New York, 1987
6. Grippo, L., Lampariello, F., Lucidi, S. A nonmonotone line search technique for Newton's method. SIAM Journal on Numerical Analysis, 23: 707-716 (1986)
7. 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)
8. Ke, X.W. Convergence of the preconvex part of Broyden's family. Jouranl of Beijing Normal University, 31(1): 6-10 (1995)
9. Liu, G.H., Han, J.Y, Sun, D.F. Global convergence of the BFGS algorithm with non-monotone linesearch. Optimizition, 34: 147-159 (1995)
10. Pearson, J.D. Variable metric methods of minimization. The Computer Journal, 12: 171-178 (1969)
11. 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
12. Toint, Ph.L. A non-monotone trust region algorithm for nonlinear optimization subject to convex constraints. Mathematical Programming, 77: 69-94 (1997)
13. Yuan, Y. Numerical methods for nonlinear programming. Shanghai Scientific and Technical Publishers, Shanghai, 1993 (in Chinese)
14. 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)