A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS

Abstract We propose a modified projected Polak–Ribière–Polyak (PRP) conjugate gradient method, where a modified conjugacy condition and a method which generates sufficient descent directions are incorporated into the construction of a suitable conjugacy parameter. It is shown that the proposed method is a modification of the PRP method and generates sufficient descent directions at each iteration. With an Armijo-type line search, the theory of global convergence is established under two weak assumptions. Numerical experiments are employed to test the efficiency of the algorithm in solving some benchmark test problems available in the literature. The numerical results obtained indicate that the algorithm outperforms an existing similar algorithm in requiring fewer function evaluations and fewer iterations to find optimal solutions with the same tolerance.

[1]  Zhong Wan,et al.  A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modifiedline search , 2011 .

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

[3]  C. Y. Wang,et al.  Convergence property of the Fletcher-Reeves conjugate gradient method with errors , 2005 .

[4]  Zhong Wan,et al.  New spectral PRP conjugate gradient method for unconstrained optimization , 2011, Appl. Math. Lett..

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

[6]  Li Zhang,et al.  Global convergence of a modified Fletcher–Reeves conjugate gradient method with Armijo-type line search , 2006, Numerische Mathematik.

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

[8]  Zhong Wan,et al.  Global Convergence of a Modified Spectral Conjugate Gradient Method , 2012, J. Appl. Math..

[9]  W. Hager,et al.  A SURVEY OF NONLINEAR CONJUGATE GRADIENT METHODS , 2005 .

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

[11]  Kok Lay Teo,et al.  New BFGS method for unconstrained optimization problem based on modified Armijo line search , 2014 .

[12]  L. Liao,et al.  New Conjugacy Conditions and Related Nonlinear Conjugate Gradient Methods , 2001 .

[13]  Yunhai Xiao,et al.  Sufficient descent directions in unconstrained optimization , 2011, Comput. Optim. Appl..

[14]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .