A new family sufficient descent conjugate gradient methods for unconstrained optimization

In this paper, a new family modified descent conjugate gradient methods are proposed for solving unconstrained optimization problems. We develop a new sufficient descent direction at every iteration. Under some suitable conditions, theoretical analysis shows that the algorithm is global convergence. Numerical results show that this method is effective in unconstrained minimizing optimization problems.