Abstract

In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained
optimization problems, the conjugate gradient parameter βk is computed as a
convex combination of βHZ
k and βCD
k . Under the wolfe line search, we prove the sufficient
descent and the global convergence. Numerical results are reported to show the
effectiveness of our procedure.

Information

Item Type:	Journal
Divisions:	» Laboratory of Computer Science and Mathematics
ePrint ID:	4867
Date Deposited:	2024-02-19
Further Information:	Google Scholar
URI:	https://www.univ-soukahras.dz/en/publication/article/4867

BibTex