Nonlinear Conjugate Gradient Methods with Sufficient Descent Condition for Large‐Scale Unconstrained Optimization

Abstract

Two nonlinear conjugate gradient‐type methods for solving unconstrained optimization problems are proposed. An attractive property of the methods, is that, without any line search, the generated directions always descend. Under some mild conditions, global convergence results for both methods are established. Preliminary numerical results show that these proposed methods are promising, and competitive with the well‐known PRP method.