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 this page instead for the normal view: Superlinear convergence of the DFP algorithm without exact line search |
scientific article; zbMATH DE number 1675988
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
