A limited memory BFGS-type method for large-scale unconstrained optimization

Computers and Mathematics with Applications

Volumn 56, Issue 4, 2008, Pages 1001-1009

  Xiao, Yunhai ^a   Wei, Zengxin ^b   Wang, Zhiguo ^a  

^a HENAN UNIVERSITY   (China)

^b GUANGXI UNIVERSITY   (China)

Author keywords

Large scale optimization; Limited memory BFGS method; Quasi Newton method; Unconstrained optimization

Indexed keywords

AEROSPACE APPLICATIONS; BOOLEAN FUNCTIONS; DATA STORAGE EQUIPMENT; DIGITAL SIGNAL PROCESSING; INTEGER PROGRAMMING; LITHIUM; NUMBER THEORY; NUMERICAL METHODS; OPTIMIZATION;

(I ,J) CONDITIONS; ARITHMETIC OPERATIONS; ELSEVIER (CO); GLOBAL CONVERGENCE; LIMITED MEMORY; UNCONSTRAINED OPTIMIZATION; UNCONSTRAINED OPTIMIZATION PROBLEMS;

SET THEORY;

EID: 46049114505     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2008.01.028     Document Type: Article

References (23)

1. Nash S.G. A survey of truncated-Newton methods. J. Comput. Appl. Math. 124 (2000) 45-59
2. Dembo R., and Steihaug T. Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Program. 26 (1983) 190-212
3. Liu D., and Nocedal J. On the limited memory BFGS method for large-scale optimization. Math. Program. 45 (1989) 503-528
4. Nocedal J. Updating quasi-Newton matrices with limited storage. Math. Comput. 35 (1980) 773-782
5. Hager W.W., and Zhang H. A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16 (2005) 170-192
6. Gilbert J.C., and Nocedal J. Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2 (1992) 21-42
7. Zhang L., Zhou W., and Li D.H. Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search. Numer. Math. 104 (2006) 561-572
8. Zhang L., Zhou W., and Li D.H. A descent modified Polak-Ribière-Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26 (2006) 629-640
9. Hager W.W., and Zhang H. A survey of nonlinear conjugate gradient methods. Pacific J. Optim. 2 (2006) 35-58
10. Gould N.I.M., Orban D., and Toint Ph.L. Numerical methods for large-scale nonlinear optimization. Acta Numer. 14 (2005) 299-361
11. Nocedal J. Large Scale Unconstrained Optimization (1997), Duff and Watson pp. 311-338
12. Wei Z., Yu G., Yuan G., and Lian Z. The superlinear convergence of a modified BFGS-type method for unconstrained optimization. Comput. Optim. Appl. 29 (2004) 315-332
13. Zhang J.Z., Deng N.Y., and Chen L.H. New quasi-Newton equation and related methods for unconstrained optimization. J. Optim. Theory Appl. 102 (1999) 147-167
14. Wei Z., Li G., and Qi L. New quasi-Newton methods for unconstrained optimization problems. Appl. Math. Comput. 175 (2006) 1156-1188
15. Broyden C.G., Dennis J.E., and Moré J.J. On the local and superlinear convergence of quasi-Newton methods. J. Inst. Math. Appl. 12 (1973) 223-246
16. 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
17. 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
18. Dai Y.H. Convergence properties of the BFGS algorithm. SIAM J. Optim. 13 (2002) 693-701
19. Mascarenhas W.F. The BFGS method with exact line search fails for non-convex objective functions. Math. Program. 99 (2004) 49-61
20. Li D.H., and Fukushima M. A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129 (2001) 15-35
21. Li D.H., and Fukushima M. On the global convergence of the BFGS methods for nonconvex unconstrained optimization problems. SIAM J. Optim. 11 (2001) 1054-164
22. Conn A.R., Gouldc N.I.M., and Toint Ph.L. CUTE: Constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21 (1995) 123-160
23. Dolan E.D., and Moré J.J. Benchmarking optimization software with performance profiles. Math. Program. 91 (2002) 201-213