Abstract

In this thesis, we present a theoretical and an algorithmic study for the conjugate gradient methods which has made the object of many researchers in this last years.
Indeed, The Hestenes-Stiefel (HS) conjugate gradient algorithm is a useful tool of unconstrained numerical optimization. which has good numerical performance but no global convergence result under traditional line searches. We proposes a line search technique that guarante the global convergence of the Hestenes-Stiefel (HS) conjugate gradient method.

Information

Item Type:	Thesis
Divisions:	» Laboratory of Computer Science and Mathematics » Faculty of Science and Technology
ePrint ID:	141
Date Deposited:	2014-11-22
Further Information:	Google Scholar
URI:	https://www.univ-soukahras.dz/en/publication/article/141

BibTex