Another hybrid conjugate gradient method as a convex combination of NVHS∗ and CD methods
Conjugate gradient methods play a fundamental role in solving unconstrained optimization problems. We propose a new hybrid conjugate gradient algorithm that forms a convex combination of βNVHS∗k and βCDk. The parameter θk is determined so as to satisfy the conjugacy condition. Under the strong Wolfe line search conditi...