Global Convergence of a Nonlinear Conjugate Gradient Method

Abstract EN

A modified PRP nonlinear conjugate gradient method to solve unconstrained optimization problems is proposed.

The important property of the proposed method is that the sufficient descent property is guaranteed independent of any line search.

By the use of the Wolfe line search, the global convergence of the proposed method is established for nonconvex minimization.

Numerical results show that the proposed method is effective and promising by comparing with the VPRP, CG-DESCENT, and DL+ methods.