A globally and superlinearly convergent Gauss-Newton-based BFGS method for symmetric nonlinear equations

SIAM Journal on Numerical Analysis

Volumn 37, Issue 1, 2000, Pages 152-172

  Li, Donghui ^a,b   Fukushima, Masao ^b  

^a HUNAN UNIVERSITY   (China)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

BFGS method; Global convergence; Superlinear convergence; Symmetric equations

Indexed keywords

EID: 0039010677     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0036142998335704     Document Type: Article

References (19)

1. C. G. BROYDEN, J. E. DENNIS, JR., AND J. J. MORÉ, On the local and superlinear convergence of quasi-Newton methods, J. Inst. Math. Appl., 12 (1973), pp. 223-245.
2. 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.
3. 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.
4. 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.
5. J. E. DENNIS AND J. J. MORÉ, Quasi-Newton methods, motivation and theory, SIAM Rev., 19 (1977), pp. 46-89.
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, MA, 1994, pp. 109-143.
9. A. GRIEWANK AND PH. L. TOINT, Local convergence analysis for partitioned quasi-Newton updates, Numer. Math., 39 (1982), pp. 429-448.
10. A. GRIEWANK, The 'global' convergence of Broyden-like methods with a suitable line search, J. Austral. Math. Soc. Ser. B, 28 (1986), pp. 75-92.
11. A. GRIEWANK, The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients, Math. Programming, 50 (1991), pp. 141-175.
12. D. LI AND M. FUKUSHIMA, A Modified BFGS Method and Its Global Convergence in Nonconvex Minimization, Technical report 98003, Department of Applied Mathematics and Physics, Kyoto University, Kyoto, Japan, 1998.
13. D. LI AND M. FUKUSHIMA, A Globally and Superlinearly Convergent Gauss-Newton-Based BFGS Method for Symmetric Equations, Technical report 98006, Department of Applied Mathematics and Physics, Kyoto University, Kyoto, Japan, 1998.
14. J. M. ORTEGA AND W. C. RHEINBOLDT, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
15. M. J. D. POWELL, On the convergence of the variable metric algorithm, J. Inst. Math. Appl., 7 (1971), pp. 21-36.
16. M. J. D. POWELL, Some global convergence properties of a variable metric algorithm for minimization without exact line searches, in Nonlinear Programming, SIAM-AMS Proceedings, Vol. IX, R. W. Cottle and C. E. Lemke, eds., AMS, Providence, RI, 1976, pp. 53-72.
17. PH. L. TOINT, Global convergence of the partitioned BFGS algorithm for convex partially separable optimization, Math. Programming, 36 (1986), pp. 290-306.
18. E. YAMAKAWA and M. FUKUSHIMA, Testing parallel variable transformation, Comput. Optim. Appl., 13 (1999), pp. 253-274.
19. Y. ZHANG AND R. P. TEWARSON, Quasi-Newton algorithms with updates from the pre-convex part of Broyden's family, IMA J. Numer. Anal., 8 (1988), pp. 487-509.