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 the normal view instead:
scientific article; zbMATH DE number 1547027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8687068223953247
0 references
0.8459704518318176
0 references
