A Spectral Conjugate Gradient Method with Inexact line searches

In this paper, a new Spectral Conjugate Gradient (SCG) method for solving unconstrained optimization problems; based on inexact line searches is investigated. The search directions of the new CG method are always sufficient descent. The global convergence property of the proposed method has been proved. Finally, we have presented some numerical results to examine the efficiency of the proposed method.