Abstract

In this paper, we present a new hybrid method to solve a nonlinear unconstrained op-
timization problem by using conjugate gradient, which is a convex combination of Y.
Liu-C. Storey (LS) conjugate gradient method and Hager-Zhang (HZ) conjugate gradi-
ent method.
This method possesses the sucient descent property with Strong Wolfe line search and
the global convergence with the strong Wolfe line search.
In the end of this paper, we illustrate our method by giving some numerical examples.

Information

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

BibTex