On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables (Q1591483)
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: On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables |
scientific article; zbMATH DE number 1547027
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables |
scientific article; zbMATH DE number 1547027 |
Statements
On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables (English)
0 references
2000
0 references
quasi-Newton method
0 references
nonlinear programming
0 references
Davidon-Fletcher-Powell algorithm
0 references
unconstrained optimization
0 references
line search
0 references
