Abstract
Unconstrained optimization problems can be solved by using few popular methods such as Conjugate Gradient (CG) method, Steepest Descent (SD) Method and Broyden-Fletcher-Goldfarb-Shanno (BFGS) method. The simplest solving method is by using SD method but nowadays CG method is used worldwide due to its convergence analysis. A few of unconstrained optimization problems with several different variables are used to prove the global convergence result of new spectral conjugate gradient to be compared with five most common k proposed by the early researches by using inexact line search.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
