A fast and robust unconstrained optimization method requiring minimum storage (Q3693274)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3918108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast and robust unconstrained optimization method requiring minimum storage |
scientific article; zbMATH DE number 3918108 |
Statements
A fast and robust unconstrained optimization method requiring minimum storage (English)
0 references
1985
0 references
conjugate gradient algorithm
0 references
unconstrained minimization
0 references
extensive computational experimentation
0 references
0 references
0 references
0 references
0.89184546
0 references
0.8867692
0 references
0.8849925
0 references
0.8705567
0 references
0.86758375
0 references
0.86722916
0 references
