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.
Full Text
Published Version (
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