A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search (Q5317554)
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 Method with Guaranteed Descent and an Efficient Line Search |
scientific article; zbMATH DE number 2206233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search |
scientific article; zbMATH DE number 2206233 |
Statements
A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search (English)
0 references
16 September 2005
0 references
conjugate gradient method
0 references
unconstrained optimization
0 references
convergence
0 references
line search
0 references
Wolfe conditions
0 references
nonlinear programming
0 references
global convergence
0 references
CUTE
0 references
0.9531457
0 references
0.9393314
0 references
0.93180245
0 references
0.9299467
0 references
0.92946744
0 references
0.9292574
0 references
