A globally convergent BFGS method with nonmonotone line search for non-convex minimization

Journal of Computational and Applied Mathematics

Volumn 230, Issue 1, 2009, Pages 95-106

  Xiao, Yunhai ^a,b   Sun, Huijuan ^b   Wang, Zhiguo ^b  

^a NANJING UNIVERSITY   (China)

^b HENAN UNIVERSITY   (China)

Author keywords

BFGS method; Global convergence; Non convex minimization; Nonmonotone line search; Secant equation

Indexed keywords

BFGS METHOD; GLOBAL CONVERGENCE; NON-CONVEX MINIMIZATION; NONMONOTONE LINE SEARCH; SECANT EQUATION;

CRYSTAL MICROSTRUCTURE;

OPTIMIZATION;

EID: 67349204068     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2008.10.065     Document Type: Article

References (27)

1. Birgin E.G., Martínez J.M., and Raydan M. Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10 (2000) 1196-1121
2. Byrd R.H., and Nocedal J. A tool for the analysis of quasi-Newton methods with application to unconstrained minimization. SIAM J. Numer. Anal. 26 (1989) 727-739
3. Byrd R.H., Nocedal J., and Yuan Y. Global convergence of a class of quasi-Newton methods on convex problems. SIAM J. Numer. Anal. 24 (1987) 1171-1189
4. Conn A.R., Gould N.I.M., and Toint Ph.L. CUTE: Constrained and unconstrained testing environment. ACM Trans. Math. Software 21 (1995) 123-160
5. Dai Y.H. On the nonmonotone line search. J. Optim. Theory Appl. 112 (2002) 315-330
6. D ai Y.H. Convergence properties of the BFGS algorithm. SIAM J. Optim. 13 (2002) 693-701
7. Deng N.Y., Xiao Y., and Zhou F.J. Nonmonotonic trust-region algorithm. J. Optim. Theory Appl. 26 (1993) 259-285
8. Dolan E.D., and Moré J.J. Benchmarking optimization software with performance profiles. Math. Program. 91 (2002) 201-213
9. Grippo L., Lampariello F., and Lucidi S. A nonmonotone line search technique for Newton's method. SIAM J. Numer. Anal. 23 (1986) 707-716
10. Grippo L., Lampariello F., and Lucidi S. A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60 (1989) 401-419
11. Grippo L., Lampariello F., and Lucidi S. A class of nonomonotone stabilization methods in unconstrained optimization. Numer. Math. 59 (1991) 779-805
12. Han J., and Liu G. Global convergence analysis of a new nonmotone BFGS algorithm on convex objective function. Comput. Optim. Appl. 7 (1997) 277-289
13. Fukushima D.H.Li.M. A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129 (2001) 15-35
14. Fukushima D.H.Li.M. On the global convergence of the BFGS method for nonconvex unconstrained optimization problems. SIAM J. Optim. 11 (2001) 1054-1064
15. Liu G., Han J., and Sun D. Global convergence of the BFGS algorithm with nonmonotone linesearch. Optim. 34 (1995) 147-159
16. L. Liu, S. Yao, Z. Wei, The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective function, J. Comput. Appl. Math. doi:10.1016/j.cam.2007.08.017
17. Mascarenhas W.F. The BFGS method with exact line searches fails for non-convex objective functions. Math. Program. 99 (2004) 49-61
18. Nocedal J., and Wright S.J. Numerical Optimization (1999), Springer, New York
19. Panier E., and Tits A. Avoiding the maratos effect by means of a nonmonotone linesearch, I: general constrained problems. SIAM J. Numer. Anal. 28 (1991) 1183-1195
20. Powell M.J.D. Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In: Cottle R.W., and Lemke C.E. (Eds). Non- linear Programming, SIAM-AMS Proceedings, Vol. LX. (1976), American Mathematical Society, Providence 53-72
21. Raydan M. The Barzilai and Borwein method for the large scale unconstrained optimization. SIAM J. Optim. 7 (1997) 26-33
22. Toint Ph.L. An assessment of non-monotone line search technique for unconstrained optimization. SIAM J. Sci. Comput. 17 (1996) 725-739
23. Toint Ph.L. A nonmonotone trust-region algorithm for nonlinear optimization subject to convex constraints. Math. Program. 77 (1997) 69-94
24. Y. Xiao, Q. Hu, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, Appl. Math. Optim. doi:10.2007/s00245-008-9038-9
25. Zhang L. A globally convergent BFGS method for nonconvex minimization without line searches. Optim. Method. Softw. 20 (2005) 737-747
26. W. Zhou, L. Zhang, Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization, J. Comput. Appl. Math., doi:10.1016/j.cam.2007.12.011
27. Zhang H., and Hager W.W. A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14 (2004) 1043-1056