Multi-step quasi-Newton methods for optimization (Q1334773)
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 643763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-step quasi-Newton methods for optimization |
scientific article; zbMATH DE number 643763 |
Statements
Multi-step quasi-Newton methods for optimization (English)
0 references
22 September 1994
0 references
Quasi-Newton methods update the existing Hessian approximation by means of data derived from the step just completed. The authors propose ``multistep'' methods, employing data from previous iterations, by means of interpolating polynomials. The results of extensive numerical experimentation indicate strongly that computational advantages can occur from such an approach, particularly as the dimension of the problem increases.
0 references
multistep quasi-Newton methods
0 references
unconstrained optimization
0 references
numerical experimentation
0 references
0 references
0 references
0.9462525
0 references
0.94349694
0 references
0.93867713
0 references
0.9358024
0 references
0.93285346
0 references
0.9326486
0 references
