A modified Liu-Storey conjugate gradient method and its global convergence for unconstrained optimization

In this paper, a sufficient descent conjugate gradient method is proposed for solving unconstrained optimization problems and a new sufficient descent search direction is proposed. Similarly, this method can be generalized to other classical conjugate gradient methods. The theoretical analysis shows that the algorithm is global convergence under some suitable conditions. Numerical results show that this new modified algorithm is effective in unconstrained optimization problems.