Answers are grounded in this paper and cite their sources.
Conjugate gradient methods are very popular for solving large scale unconstrained optimization problems because of their simplicity to implement and low memory requirements. In this paper, we present a hybrid three-term conjugate gradient method with a direction that always satisfies the sufficient descent condition. We establish global convergence of the new method under the weak Wolfe line search conditions. We also report some numerical results of the proposed method compared to relevant methods in the literature.
No takes yet. Share an insight, caveat, or question.
Diphofu et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: