The convergence of conjugate gradient method with nonmonotone line search (Q606706)
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: The convergence of conjugate gradient method with nonmonotone line search |
scientific article; zbMATH DE number 5817276
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The convergence of conjugate gradient method with nonmonotone line search |
scientific article; zbMATH DE number 5817276 |
Statements
The convergence of conjugate gradient method with nonmonotone line search (English)
0 references
18 November 2010
0 references
The authors propose a new nonmonotone line search for Liu-Storey conjugate gradient method for unconstrained minimization problems of the form \[ \min f(x),\quad x\in\mathbb{R}^n. \] Numerical experiments are given and show that the new approach is effective in practical computation.
0 references
unconstrained optimization
0 references
conjugate gradient method
0 references
global convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9290077686309814
0 references
0.9215481281280518
0 references
0.8981404900550842
0 references
0.8953500986099243
0 references
0.891954779624939
0 references
