Abstract
A new hybrid conjugate gradient algorithm is considered. The conjugate gradient parameter βk is computed as a convex combination of βCD k and βLS k. The parameter θk is computed in such a way that the conjugacy condition is satisfied. The strong Wolfe line search conditions are used. Numerical comparisons show that the present hybrid conjugate gradient algorithm often behaves better than some known algorithms.
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.
