Using approximate secant equations in limited memory methods for multilevel unconstrained optimization (Q429494)
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: Using approximate secant equations in limited memory methods for multilevel unconstrained optimization |
scientific article; zbMATH DE number 6048078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using approximate secant equations in limited memory methods for multilevel unconstrained optimization |
scientific article; zbMATH DE number 6048078 |
Statements
Using approximate secant equations in limited memory methods for multilevel unconstrained optimization (English)
0 references
19 June 2012
0 references
multilevel problems
0 references
nonlinear conjugate gradient methods
0 references
limited-memory algorithms
0 references
0 references
0 references
0 references
0.7979910373687744
0 references
0.7966126799583435
0 references
0.7582280039787292
0 references
0.7579747438430786
0 references
0.757093071937561
0 references
