A New Conjugate Gradient Algorithm using Kafaki and Gambry Coefficient in Unconstrained Optimization

In this paper, a new conjugate gradient formula using Kafaki and Gambry is proposed. And we give the global convergence of new method.Also we give descent and sufficient descent conditions.Numerical results, show that this new formula is more efficient for solving unconstrained optimization problems comparing with other method (H/S),depending on the iterations and the number of functions evaluation.