On the global convergence of the BFGS method for nonconvex unconstrained optimization problems

SIAM Journal on Optimization

Volumn 11, Issue 4, 2001, Pages 1054-1064

  Li, Dong Hui ^a   Fukushima, Masao ^b  

^a HUNAN UNIVERSITY   (China)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

BFGS method; Global convergence; Unconstrained optimization

Indexed keywords

EID: 0035646690     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623499354242     Document Type: Article

References (18)

1. R. BYRD AND J. NOCEDAL, A tool for the analysis of quasi-Newton methods with application to unconstrained minimization, SIAM J. Numer. Anal., 26 (1989), pp. 727-739.
2. R. BYRD, J. NOCEDAL, AND Y. YUAN, Global convergence of a class of quasi-Newton methods on convex problems, SIAM J. Numer. Anal., 24 (1987), pp. 1171-1190.
3. J. E. DENNIS, JR. AND J. J. MORÉ, A characterization of superlinear convergence and its application to quasi-Newton methods, Math. Comp., 28 (1974), pp. 549-560.
4. J. E. DENNIS, JR. AND J. J. MORÉ, Quasi-Newton methods, motivation and theory, SIAM Rev., 19 (1977), pp. 46-89.
5. J. E. DENNIS, JR. AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1983.
6. L. C. W. DIXON, Variable metric algorithms: Necessary and sufficient conditions for identical behavior on nonquadratic functions, J. Optim. Theory Appl., 10 (1972), pp. 34-40.
7. R. FLETCHER, Practical Methods of Optimization, 2nd ed., John Wiley & Sons, Chichester, 1987.
8. R. FLETCHER, An overview of unconstrained optimization, in Algorithms for Continuous Optimization: The State of the Art, E. Spedicato, ed., Kluwer Academic Publishers, Boston, 1994, pp. 109-143.
9. A. GRIEWANK, The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients, Math. Program., 50 (1991), pp. 141-175.
10. A. GRIEWANK AND PH. L. TOINT, Local convergence analysis for partitioned quasi-Newton updates, Numer. Math., 39 (1982), pp. 429-448.
11. D. H. LI AND M. FUKUSHIMA, A globally and superlinearly convergent Gauss-Newton-based BFGS method for symmetric nonlinear equations, SIAM J. Numer. Anal., 37 (1999), pp. 152-172.
12. D. H. LI AND M. FUKUSHIMA, A modified BFGS method and its global convergence in nonconvex minimization, J. Comput. Appl. Math., to appear.
13. C. T. KELLEY, Iterative Methods for Optimization, SIAM, Philadelphia, 1999.
14. J. J. MORÉ, B. S. GARBOW, AND K. E. HILLSTROME, Testing unconstrained optimization software, ACM Trans. Math. Software, 7 (1981), pp. 17-41.
15. J. NOCEDAL, Theory of algorithms for unconstrained optimization, Acta Numer., 1 (1992), pp. 199-242.
16. M. J. D. POWELL, On the convergence of the variable metric algorithm, J. Inst. Math. Appl., 7 (1971), pp. 21-36.
17. M. J. D. POWELL, Some global convergence properties of a variable metric algorithm for minimization without exact line searches, in Nonlinear Programming, SIAM-AMS Proc. IX, R. W. Cottle and C. E. Lemke, eds., AMS, Providence, RI, 1976, pp. 53-72.
18. PH. L. TOINT, Global convergence of the partitioned BFGS algorithm for convex partially separable optimization, Math. Program., 36 (1986), pp. 290-306.