Résumé

In this paper, we proposed a new hybrid conjugate gradient algorithm for solving unconstrained
optimization problems as a convex combination of the Dai-Yuan algorithm, conjugate-descent
algorithm, and Hestenes-Stiefel algorithm. This new algorithm is globally convergent and satisfies the
sufficient descent condition by using the strong Wolfe conditions. The numerical results show that the
proposed nonlinear hybrid conjugate gradient algorithm is efficient and robust.

Information

Item Type:	Journal
Divisions:	» Laboratoire d’Informatique et Mathématiques
ePrint ID:	4827
Date Deposited:	2024-02-06
Further Information:	Google Scholar
URI:	https://www.univ-soukahras.dz/fr/publication/article/4827

BibTex