论文信息 - Convergence properties of a class of nonlinear conjugate gradient methods

Convergence properties of a class of nonlinear conjugate gradient methods

Conjugate gradient methods are a class of important methods for unconstrained optimization problems, especially when the dimension is large. In this paper, we study a class of modified conjugate gradient methods based on the famous LS conjugate gradient method, which produces a sufficient descent direction at each iteration and converges globally provided that the line search satisfies the strong Wolfe condition. At the same time, a new specific nonlinear conjugate gradient method is constructed. Our numerical results show that the new method is very efficient for the given test problems by comparing with the famous LS method, PRP method and CG-DESCENT method.

Jinkui Liu

[1] C. Storey,et al. Efficient generalized conjugate gradient algorithms, part 1: Theory , 1991 .

[2] Jorge Nocedal,et al. Global Convergence Properties of Conjugate Gradient Methods for Optimization , 1992, SIAM J. Optim..

[3] Zengxin Wei,et al. A descent nonlinear conjugate gradient method for large-scale unconstrained optimization , 2007, Appl. Math. Comput..

[4] Boris Polyak. The conjugate gradient method in extremal problems , 1969 .

[5] William W. Hager,et al. A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search , 2005, SIAM J. Optim..

[6] Luigi Grippo,et al. A globally convergent version of the Polak-Ribière conjugate gradient method , 1997, Math. Program..

[7] C. M. Reeves,et al. Function minimization by conjugate gradients , 1964, Comput. J..

[8] Weijun Zhou,et al. A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence , 2006 .

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

[10] Yuhong Dai. Nonlinear Conjugate Gradient Methods , 2011 .

[11] Guoyin Li,et al. Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems , 2008, Math. Comput..