Abstract

We study the global convergence of a two-parameter family of conjugate gradient methods in which the line search procedure is replaced by a fixed formula of stepsize. This character is of significance if the line search is ex-pensive in a particular application. In addition to the convergence results, we present computational results for various conjugate gradient methods wi-thout line seartch.

Key words :
Conjugate gradient. Algorithm. Global convergence. Inexact line search.Armijoline search. StrongWolfe line search.WeakWolfe line search. Hestenes-Stiefel Method. Fletcher-Reeves Method. Polak-Ribière-Polyak Method. Conjugatedescent Method. Dai-Yuan Method. Liu - Storey Method. BFGS Method.

Information

Item Type:	Thesis
Divisions:
ePrint ID:	225
Date Deposited:	2014-12-17
Further Information:	Google Scholar
URI:	https://www.univ-soukahras.dz/en/publication/article/225

BibTex