New BFGS method for unconstrained optimization problem based on modified Armijo line search

Optimization

Volumn 63, Issue 2, 2014, Pages 285-304

  Wan, Zhong ^a   Teo, Kok Lay ^b   Shen, XianLong ^a   Hu, ChaoMing ^a  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b CURTIN UNIVERSITY   (Australia)

Author keywords

Armijo type line search; BFGS method; global convergence; unconstrained optimization

Indexed keywords

EID: 84893576045     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331934.2011.644284     Document Type: Article

References (34)

1. Al-Baali, M. 2003. " Quasi-newton algorithms for large-scale nonlinear least-squares ". In High Performance Algorithms and Software for Nonlinear Optimization, Edited by: Di Pillo, G and Murli, A. 1 - 21. The Netherlands: Kluwer Academic Publishers, Dordrecht.
2. Al-Baali, M and Lucio, G. 2009. On practical modifications of the Quasi-Newton BFGS method. Adv. Model. Optim., 11: 63 - 76.
3. Byrd, R and Nocedal, J. 1989. A tool for the analysis of quasi-Newton methods with application to unconstrained minimization. SIAM J. Numer. Anal., 26: 727 - 739.
4. Byrd, R, Nocedal, J and Yuan, Y. 1987. Global convergence of a class of quasi-Newton methods on convex problems. SIAM J. Numer. Anal., 24: 1171 - 1190.
5. Dai, YH. 2002. Convergence properties of the BFGS algorithm. SIAM J. Optim., 13: 693 - 701.
6. Emin, K. 2006. Modified secant-type methods for unconstrained optimization. Appl. Math. Comput., 181: 1349 - 1356.
7. Fletcher, R. 1994. " An overview of unconstrained optimization ". In Algorithms for Continuous Optimization: The State of the Art, Edited by: Spedicato, E. 109 - 143. Boston: Kluwer Academic.
8. Gill, PE and Leonard, MW. 2003. Limited-memory reduced-Hessian methods for large-scale unconstrained optimization. SIAM J. Optim., 14: 380 - 401.
9. Griewank, A. 1991. The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients. Math. Program., 50: 141 - 175.
10. Griewank, A and Toint, PL. 1982. Local convergence analysis for partitioned quasi-Newton updates. Numer. Math., 39: 429 - 448.
11. Guo, Q and Liu, JG. 2006. Global convergence of a modified BFGS-type method for unconstrained nonconvex minimization. J. Appl. Math. Comput., 21: 259 - 267.
12. Li, DH and Fukushima, M. 1999. A globally and superlinearly convergent Gauss-Newton-based BFGS method for symmetric nonlinear equations. SIAM J. Numer. Anal., 37: 152 - 172.
13. Li, DH and Fukushima, M. 2001. A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math., 129: 15 - 35.
14. Li, DH and Fukushima, M. 2001. On the global convergence of the BFGS method for for nonconvex unconstrained optimization problems. SIAM J. Optim., 11: 1054 - 1064.
15. Liu, DC and Nocedal, J. 1989. On the limited memory BFGS method for large scale optimization. Math. Program., 45: 503 - 528.
16. Liu, JG, Xia, ZQ, Ge, RD and Guo, Q. 2004. An modified BFGS method. J. Appl. Math. Comput., 16: 195 - 205.
17. Mascarenhas, WF. 2004. The BFGS method with exact line searches fails for non-convex objective functions. Math. Program., 99: 49 - 61.
18. Moré, JJ, Garbow, BS and Hillstrome, KE. 1981. Testing unconstrained optimization software. ACM Trans. Math. Softw., 7: 17 - 41.
19. Nocedal, J and Wright, S. 1999. Numerical Optimization, New York: Springer.
20. Potra, FA and Shi, Y. 1995. Efficient line search algorithm for unconstrained optimization. J. Optim. Theory Appl., 85: 677 - 704.
21. Seifert, T and Schmidt, T. 2008. Line-search methods in general return mapping algorithms with application to porous plasticity. Int. J. Numer. Methods Eng., 73: 1468 - 1495.
22. Shi, ZJ and Shen, J. 2005. New inexact line search method for unconstrained optimization1. J. Optim. Theory Appl., 127: 425 - 446.
23. Siegel, D. 1994. Modifying the BFGS update by a new column scaling technique. Math. Program., 66: 45 - 78.
24. Wei, ZX, Li, G and Qi, L. 2006. New quasi-Newton methods for unconstrained optimization problems. Appl. Math. Comput., 175: 1156 - 1188.
25. Xiao, YH, Wei, ZX and Zhang, L. 2006. A modified BFGS method without line searches for nonconvex unconstrained optimization. Adv. Theor. Appl. Math., 1: 149 - 162.
26. Yabe, H, Ogasawara, H and Yoshino, M. 2007. Local and superlinear convergence of quasi-Newton methods based on modified secant conditions. J. Comput. Appl. Math., 205: 617 - 632.
27. Yuan, Y. 1991. A modified BFGS algorithm for unconstrained optimization. IMA J. Numer. Anal., 11: 325 - 332.
28. Yuan, GL and Lu, XW. 2008. A new line search method with trust region for unconstrained optimization. Commun. Appl. Nonlinear Anal., 15: 35 - 49.
29. Zhang, HC and Hager, WW. 2004. A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim., 14: 1043 - 1056.
30. Zhang, JZ and Xu, CX. 2001. Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations. J. Comput. Appl. Math., 137: 269 - 278.
31. Zhou, W and Chen, XJ. Global convergence of a new hybrid Gauss-Newton structured BFGS method for nonlinear least squares problems, SIAM J. Optim. 20 (2010), pp. 2422-2441
32. Zhou, W and Li, D. 2008. A globally convergent BFGS method for nonlinear monotone equations without any merit function. Math. Comput., 77: 2231 - 2240.
33. Zhou, W and Zhang, L. 2009. Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization. J. Comput. Appl. Math., 223: 40 - 47.
34. Zhou, W and Zhang, L. 2010. Global convergence of a regularized factorized quasi-Newton method for nonlinear least squares problems. Comput. Appl. Math., 29: 195 - 214.