Convergence analysis of a modified BFGS method on convex minimizations

Computational Optimization and Applications

Volumn 47, Issue 2, 2010, Pages 237-255

  Yuan, Gonglin ^a   Wei, Zengxin ^a  

^a GUANGXI UNIVERSITY   (China)

Author keywords

BFGS method; Global convergence; Linesearch; Superlinear convergence; Unconstrained optimization

Indexed keywords

BFGS METHOD; GLOBAL CONVERGENCE; LINESEARCH; SUPERLINEAR CONVERGENCE; UNCONSTRAINED OPTIMIZATION;

OPTIMIZATION;

EID: 77956768212     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-008-9219-0     Document Type: Article

References (43)

1. C.G. Broyden J.E. Dennis J.J. Moré 1973 On the local and superlinear convergence of quasi-Newton methods J. Inst. Math. Appl. 12 223 246 0282.65041 10.1093/imamat/12.3.223 341853
2. R. Byrd J. Nocedal 1989 A tool for the analysis of quasi-Newton methods with application to unconstrained minimization SIAM J. Numer. Anal. 26 727 739 0676.65061 10.1137/0726042 997665
3. R. Byrd J. Nocedal Y. Yuan 1987 Global convergence of a class of quasi-Newton methods on convex problems SIAM J. Numer. Analysis 24 1171 1189 0657.65083 10.1137/0724077 909072
4. Y. Dai 2003 Convergence properties of the BFGS algorithm SIAM J. Optim. 13 693 701 10.1137/S1052623401383455 (Pubitemid 36971108)
5. Davidon, W.C.: Variable metric methods for minimization. Argonne National Labs Report, Argonne, IL (1959)
6. J.E. Dennis Jr. J.J. Moré 1977 Quasi-Newton methods, motivation and theory SIAM Rev. 19 46 89 0356.65041 10.1137/1019005 445812
7. J.E. Dennis J.J. Moré 1974 A characterization of superlinear convergence and its application to quasi-Newton methods Math. Comp. 28 549 560 0282.65042 343581
8. Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs (1983)
9. L.C.W. Dixon 1972 Variable metric algorithms: Nessary and sufficient conditions for identical behavior on nonquadratic functions J. Optim. Theory Appl. 10 34 40 0226.49014 10.1007/BF00934961
10. E.D. Dolan J.J. Moré 2002 Benchmarking optimization software with performance profiles Math. Program. 91 201 213 1049.90004 10.1007/s101070100263 1875515 (Pubitemid 44744777)
11. Fletcher, R.: Practical Methods of Optimization, 2nd edn. Wiley, Chichester (1987)
12. N.I.M. Gould 2003 Dominique Orban and Philippe L Toint, CUTEr(and SifDec): A Constrained and Unconstrained Testing Environment, revisited. ACM Trans. Math. Softw. 29 373 394 1068.90526
13. A. Griewank 1991 The global convergence of partioned BFGS on problems with convex decompositons and Lipschitzian gradients Math. Program. 50 141 175 0736.90068 10.1007/BF01594933 1103931
14. A. Griewank 1986 The 'global' convergence of Broyden-like methods with a suitable line search J. Austral. Math. Soc. Ser. B 28 75 92 0596.65034 10.1017/S0334270000005208 846784
15. A. Griewank Ph.L. Toint 1982 Local convergence analysis for partitioned quasi-Newton updates Numer. Math. 39 429 448 0505.65018 10.1007/BF01407874 678746
16. J.Y. Han G.H. Liu 1997 Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions Comput. Optim. Appl. 7 277 289 0876.90072 10.1023/A:1008656711925 1439560
17. J.Y. Han G.H. Liu 1992 Notes on the general form of stepsize selection OR Decis. Mak. 1 619 624
18. D. Li M. Fukushima 2001 A modified BFGS method and its global convergence in nonconvex minimization J. Comput. Appl. Math. 129 15 35 0984.65055 10.1016/S0377-0427(00)00540-9 1823208 (Pubitemid 32596036)
19. D. Li M. Fukushima 2001 On the global convergence of the BFGS method for nonconvex unconstrained optimization problems SIAM J. Optim. 11 1054 1064 1010.90079 10.1137/S1052623499354242 1855221
20. G. Li C. Tang Z. Wei 2007 New conjugacy condition and related new conjugate gradient methods for unconstrained optimization problems J. Comput. Appl. Math. 202 532 539 10.1016/j.cam.2006.03.005 2319974 (Pubitemid 46275284)
21. G.H. Liu J.Y. Han Z.L. Xu 1995 Global convergence of the variable metric algorithms with a generalized Wolfe linesearch J. Math. Res. Exp. 4 499 508 1362892
22. G.H. Liu J.Y. Han D.F. Sun 1995 Global convergence analysis of the BFGS algorithm with nonmonotone linesearch Optimization 34 147 159 0858.90122 10.1080/02331939508844101 1346948
23. G.H. Liu J.M. Peng 1992 The convergence properties of a nonmonotonic algorithm J. Comput. Math. 1 65 71
24. W.F. Mascarenhas 2004 The BFGS method with exact line searches fails for non-convex objective functions Math. Program. 99 49 61 1082.90108 10.1007/s10107-003-0421-7 2031776 (Pubitemid 40871731)
25. J.J. Moré B.S. Garbow K.E. Hillstrome 1981 Testing unconstrained optimization software ACM Trans. Math. Softw. 7 17 41 0454.65049 10.1145/355934.355936
26. J.D. Pearson 1969 Variable metric methods of minimization Comput. J. 12 171 178 0207.17301 10.1093/comjnl/12.2.171 242355
27. M.J.D. Powell 1971 On the convergence of the variable metric algorithm J. Inst. Math. Appl. 7 21 36 0217.52804 10.1093/imamat/7.1.21 279977
28. Powell, M.J.D.: Some properties of the variable metric algorithm. In: Lootsma, F.A. (ed.) Numerical Methods for Nonlinear Optimization. Academic Press, London (1972)
29. Powell, M.J.D.: Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In: Cottle, R.W., Lemke, C.E. (eds.) Nonlinear Programming, SIAM-AMS Proceedings, vol. IX. SIAM, Philadelphia (1976)
30. Powell, M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.) Nonlinear Programming, pp. 31-65. Academic Press, New York (1970)
31. J. Schropp 1997 A note on minimization problems and multistep methods Numer. Math. 78 87 101 0884.34021 10.1007/s002110050305 1483570 (Pubitemid 128000990)
32. J. Schropp 2000 One-step and multistep procedures for constrained minimization problems IMA J. Numer. Anal. 20 135 152 0945.65065 10.1093/imanum/20.1.135 1736954
33. Ph.L. Toint 1986 Global convergence of the partioned BFGS algorithm for convex partially separable opertimization Math. Program. 36 290 306 0626.90076 10.1007/BF02592063 866412
34. D.J. Van Wyk 1984 Differential optimization techniques Appl. Math. Model. 8 419 424 0555.90092 10.1016/0307-904X(84)90048-9 (Pubitemid 15491591)
35. M.N. Vrahatis G.S. Androulakis J.N. Lambrinos G.D. Magolas 2000 A class of gradient unconstrained minimization algorithms with adaptive stepsize J. Comput. Appl. Math. 114 367 386 0958.65072 10.1016/S0377-0427(99)00276-9 1737085 (Pubitemid 30541672)
36. Wei, Z., Li, G., Qi, L.: New Quasi-Newton Methods for unconstrained optimization problems. preprint
37. Z. Wei L. Qi X. Chen 2003 An SQP-type method and its application in stochastic programming J. Optim. Theory Appl. 116 205 228 1030.90142 10.1023/A:1022122521816 1961035
38. Z. Wei G. Yu G. Yuan Z. Lian 2004 The superlinear convergence of a modified BFGS-type method for unconstrained optimization Comput. Optim. Appl. 29 315 332 1070.90089 10.1023/B:COAP.0000044184.25410.39 2101852
39. G.L. Yuan 2008 Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems Optim. Lett. 10.1007/s11590-008-0086-5
40. G.L. Yuan X.W. Lu 2008 A new line search method with trust region for unconstrained optimization Commun. Appl. Nonlinear Analysis 15 1 35 49 1146.49031 2379380
41. Yuan, Y., Sun, W.: Theory and Methods of Optimization. Science Press of China, Beijing (1999)
42. G.L. Yuan Z.X. Wei 2008 New Line Search Methods for Unconstrained Optimization J. Korean Stat. Soc. 10.1016/j.jkss.2008.05.004
43. G. Yuan Z. Wei 2008 The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions Acta Math. Sinica, Eng. Ser. 24 1 35 42 1152.65072 10.1007/s10114-007-1012-y 2384230