Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems (Q1686668): Difference between revisions
From MaRDI portal
Latest revision as of 21:37, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems |
scientific article |
Statements
Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems (English)
0 references
15 December 2017
0 references
This paper introduces two Dai-Liao-type methods by modifying the conjugate gradient parameter for unconstrained optimization problems. The convergence for uniformly convex objective functions is established. The efficiency of the proposed methods are illustrated by some numerical results.
0 references
unconstrained optimization
0 references
Dai-Liao-type methods
0 references
strong convergence
0 references
global convergence
0 references
strong Wolfe line search
0 references
numerical result
0 references
0 references
0 references
0 references
0 references
0 references
