## Global convergence of a modified BFGS-type method for unconstrained non-convex minimization.(English)Zbl 1128.65040

Authors’ summary: To the unconstrained programming of a non-convex function, this article gives a modified Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm associated with the general line search model. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficiency of the new quasi-Newton iteration equation $$B_{k+1}s_k=y^*_k$$, where $$y^*_k$$ is the sum of $$y_k$$ and $$A_ks_k$$, and $$A_k$$ is some matrix. The global convergence properties of the algorithm associating with the general form of line search is proved.

### MSC:

 65K05 Numerical mathematical programming methods 90C26 Nonconvex programming, global optimization
Full Text:

### References:

 [1] J. J. Dennis, J. J. Moré,Quasi-Newton methods, motivation and theory, SIAM REIEW19 (1977) 46–89. · Zbl 0356.65041 [2] M. J. D. Powell,Some Global Convergence Properties of a Variable Metric Algorithm for Minimization without Exact Line Searches, Nonlinear Programming, SIAM-AMS proceedings Cottle R W and Lemke C E, eds.9 (1976), 53–72. · Zbl 0338.65038 [3] J. Werner,Uber die global konvergenze von variablemetric verfahren mit nichtexakter schrittweitenbestimmong, Numer. Math.31 (1978) 321–334. · Zbl 0427.65047 [4] Walter F. Mascarenhas,The BFGS method with exact line searches fails for non-convex objective functions, Math. Program.99 (2004) 49C61. · Zbl 1082.90108 [5] J. D. Pearson,Variable Metric Methods of Minimization, Computer J.12 (1969) 171–178. · Zbl 0207.17301 [6] Han and Liu,General Form of Stepsize Selection Rules of Linesearch and Relevant Analysis of Global Convergence of BFGS Algorithm (Chinese), Acta Mathematicae Appliatae Sinica1 (1995) 112–122. · Zbl 0858.90119 [7] L. Armijo,Minimization of functions having lipschitz-continuous first partial derivatives, Pacific J. of Mathematics,16 1-3. · Zbl 0202.46105 [8] A. Goldstein, and J. Price,An effective algorithm for minimization, Numericahe Mathematik10 (1967) 184–189. · Zbl 0161.35402 [9] P. Wolfe,Convergence conditions for ascent methods, SIAM Review11 (1969) 226–235. · Zbl 0177.20603 [10] J. G. Liu, Q. Guo,Global Convergence Properties of the Modified BFGS Method, J. of Appl. Math. & Computing16 (2004) 195–205. · Zbl 1065.65077 [11] J. G. Liu, Z. Q. Xia, R. D. Ge, and Q. Guo,An modified BFGS method for non-convex minimization problems (Chinese), Operation Research and Management13 (2004) 62–65. [12] Z. X. Wei, G. H. Yu, G. L. Yuan, Z. G. Lian,The superlinear convergence of a modifed BFGS-Type method for unconstrained optimization, Computational optimization and applications29 (2004) 315–332. · Zbl 1070.90089 [13] Z. Wei, G. Li, and L. Qi,New quasi-Newton methods for unconstrained optimization probelms, to appear in mathematical programming.(search the paper). [14] Z. Wei, L. Qi, and X. Chen,An SQP-type method and its application in stochastic programming, J. Optim. Theory Appl.116 (2003) 205–228. · Zbl 1030.90142 [15] Rendong Ge and Zunquan Xia,An ABS Algorithm for Solving Singular Nonlinear System with Rank One Defect, J. Appl. Math. and Computing(old:KJCAM)9 (2002) 167–184. [16] Rendong Ge and Zunquan Xia,An ABS Algorithm for Solving Singular Nonlinear System with Rank Defects, J. of Appl. Math. & Computing12 (2003) 1–20. · Zbl 1057.65024
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.