Superlinear convergence of the DFP algorithm without exact line search (Q5949537)
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 1675988
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Superlinear convergence of the DFP algorithm without exact line search |
scientific article; zbMATH DE number 1675988 |
Statements
Superlinear convergence of the DFP algorithm without exact line search (English)
0 references
20 January 2003
0 references
\(Q\)-superlinearly convergent
0 references
nonlinear programming
0 references
line search
0 references
globally convergent
0 references
0.9377087950706482
0 references
0.8880079984664917
0 references
0.8475544452667236
0 references
