Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
