Convergence analysis of a modified BFGS method on convex minimizations

A modified BFGS method is proposed for unconstrained optimization. The global convergence and the superlinear convergence of the convex functions are established under suitable assumptions. Numerical results show that this method is interesting.

[1]  Gonglin Yuan,et al.  The Superlinear Convergence of a Modified BFGS-Type Method for Unconstrained Optimization , 2004, Comput. Optim. Appl..

[2]  Johannes Schropp.  A note on minimization problems and multistep methods , 1997 .

[3]  J. Nocedal,et al.  A tool for the analysis of Quasi-Newton methods with application to unconstrained minimization , 1989 .

[4]  Defeng Sun,et al.  Global convergece of the bfgs algorithm with nonmonotone linesearch ∗ ∗this work is supported by national natural science foundation$ef: , 1995 .

[5]  Gonglin Yuan,et al.  Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems , 2009, Optim. Lett..

[6]  Anderas Griewank.  The “global” convergence of Broyden-like methods with suitable line search , 1986, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[7]  Guanghui Liu,et al.  Global Convergence Analysis of a New Nonmonotone BFGS Algorithm on Convex Objective Functions , 1997, Comput. Optim. Appl..

[8]  M. Powell.  On the Convergence of the Variable Metric Algorithm , 1971 .

[9]  P. Toint,et al.  Local convergence analysis for partitioned quasi-Newton updates , 1982 .

[10]  J. D. Pearson.  Variable metric methods of minimisation , 1969, Comput. J..

[11]  M. Powell.  A New Algorithm for Unconstrained Optimization , 1970 .

[12]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[13]  Nicholas I. M. Gould,et al.  CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.

[14]  Andreas Griewank,et al.  The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients , 1991, Math. Program..

[15]  J. J. Moré,et al.  A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods , 1973 .

[16]  John E. Dennis,et al.  On the Local and Superlinear Convergence of Quasi-Newton Methods , 1973 .

[17]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[18]  Guoyin Li,et al.  New quasi-Newton methods for unconstrained optimization problems , 2006, Appl. Math. Comput..

[19]  J. J. Moré,et al.  Quasi-Newton Methods, Motivation and Theory , 1974 .

[20]  Yu-Hong Dai,et al.  Convergence Properties of the BFGS Algoritm , 2002, SIAM J. Optim..

[21]  D. J. van Wyk.  Differential optimization techniques , 1984 .

[22]  M. N. Vrahatisa,et al.  A class of gradient unconstrained minimization algorithms with adaptive stepsize , 1999 .

[23]  J. Nocedal,et al.  Global Convergence of a Class of Quasi-newton Methods on Convex Problems, Siam Some Global Convergence Properties of a Variable Metric Algorithm for Minimization without Exact Line Searches, Nonlinear Programming, Edited , 1996 .

[24]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[25]  Walter F. Mascarenhas,et al.  The BFGS method with exact line searches fails for non-convex objective functions , 2004, Math. Program..

[26]  Zengxin Wei,et al.  The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions , 2008 .

[27]  M. Fukushima,et al.  A modified BFGS method and its global convergence in nonconvex minimization , 2001 .

[28]  Zengxin Wei,et al.  New line search methods for unconstrained optimization , 2009 .

[29]  Philippe L. Toint,et al.  Global convergence of the partitioned BFGS algorithm for convex partially separable optimization , 1986, Math. Program..

[30]  Masao Fukushima,et al.  On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems , 2000, SIAM J. Optim..

[31]  Jorge J. Moré,et al.  Testing Unconstrained Optimization Software , 1981, TOMS.

[32]  Tang Huan-wen.  A New Line Search Method for Unconstrained Optimization , 2005 .

[33]  Johannes Schropp.  One-step and multistep procedures for constrained minimization problems , 2000 .

[34]  Guoyin Li,et al.  New conjugacy condition and related new conjugate gradient methods for unconstrained optimization , 2007 .

[35]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[36]  L. Dixon.  Variable metric algorithms: Necessary and sufficient conditions for identical behavior of nonquadratic functions , 1972 .

[37]  Liqun Qi,et al.  An SQP-Type Method and Its Application in Stochastic Programs , 2003 .