On the global complexity bounds of two nonlinear conjugate gradient methods for nonconvex optimization (Q4612299)
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: On the global complexity bounds of two nonlinear conjugate gradient methods for nonconvex optimization |
scientific article; zbMATH DE number 7009403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the global complexity bounds of two nonlinear conjugate gradient methods for nonconvex optimization |
scientific article; zbMATH DE number 7009403 |
Statements
31 January 2019
0 references
MHS method
0 references
MFR method
0 references
global complexity bound
0 references
0.7941210865974426
0 references
0.7906322479248047
0 references
0.786351203918457
0 references
0.7817670702934265
0 references
0.7793261408805847
0 references
