Abstract

Conjugate gradient methods are probably the most famous iterative methods for solving large scale optimization problems in scientific and engineering computation, characterized by the simplicity of their iteration and their low memory requirements. It is well known that the search direction plays a main role in the line search method. In this paper, we propose a new search direction with the Wolfe line search technique for solving unconstrained optimization problems. Under the above line searches and some assumptions, the global convergence properties of the given methods are discussed. Numerical results and comparisons with other CG methods are given.

Information

Item Type:	Conference
Divisions:	» Laboratory of Computer Science and Mathematics » Faculty of Science and Technology
ePrint ID:	328
Date Deposited:	2015-03-21
Further Information:	Google Scholar
URI:	https://www.univ-soukahras.dz/en/publication/article/328

BibTex