Abstract

The conjugate gradient method was an efficient technique for solving optimization
problems. In this paper, we propose a new efficient (CG) coefficient , k b is computed as
a convex combination of Salleh and Alhawarat algorithm and CG-Descent algorithm. We
prove the sufficient descent condition and the global convergence of the proposed method.
It is established that the k a satisfies the strong Wolfe line search conditions. The numerical
results indicate that our method is robust and competitive.

Information

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

BibTex