A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization (Q1665439)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization |
scientific article; zbMATH DE number 6926125
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization |
scientific article; zbMATH DE number 6926125 |
Statements
A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization (English)
0 references
27 August 2018
0 references
Summary: A new nonlinear conjugate gradient formula, which satisfies the sufficient descent condition, for solving unconstrained optimization problem is proposed. The global convergence of the algorithm is established under weak Wolfe line search. Some numerical experiments show that this new WWPNPRP algorithm is competitive to the SWPPRP algorithm, the SWPHS algorithm, and the WWPDYHS algorithm.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
