The global convergence of a new mixed conjugate gradient method for unconstrained optimization (Q1952993)
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 global convergence of a new mixed conjugate gradient method for unconstrained optimization |
scientific article; zbMATH DE number 6170015
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The global convergence of a new mixed conjugate gradient method for unconstrained optimization |
scientific article; zbMATH DE number 6170015 |
Statements
The global convergence of a new mixed conjugate gradient method for unconstrained optimization (English)
0 references
3 June 2013
0 references
Summary: We propose and generalize a new nonlinear conjugate gradient method for unconstrained optimization. The global convergence is proved with the Wolfe line search. Numerical experiments are reported which support the theoretical analyses and show the presented methods outperforming CGDESCENT method.
0 references
nonlinear conjugate gradient method
0 references
unconstrained optimization
0 references
global convergence
0 references
Wolfe line search
0 references
numerical experiments
0 references
0 references
0 references
0 references
