Abstract

Abstract


The aim of this thesis is to present a new and fundamentally different conjugate gradient method which, when applied to solve unconstrained optimization problems, gives good convergence results and ensures the sufficient descent condition. To achieve this, we will use a well-known technique, the hybrid method based on a convex combination of three classical conjugate gradient methods. Furthermore, numerical experiments were performed to test the effectiveness of the proposed method, which confirmed its promising potential.
Keywords: Unconstrained optimization, Conjugate gradient, Algorithm, Global convergence, line search.

Information

Item Type:	Thesis
Divisions:	» Faculty of Science and Technology
ePrint ID:	4930
Date Deposited:	2024-04-29
Further Information:	Google Scholar
URI:	https://www.univ-soukahras.dz/en/publication/article/4930

BibTex