The revised DFP algorithm without exact line search (Q1811670)
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: The revised DFP algorithm without exact line search |
scientific article; zbMATH DE number 1929410
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The revised DFP algorithm without exact line search |
scientific article; zbMATH DE number 1929410 |
Statements
The revised DFP algorithm without exact line search (English)
0 references
17 June 2003
0 references
The convergence of the Davidon-Fletcher-Powell (DFP) algorithm with revised search direction is investigated. It is proved, under some inexact line searches, that the algorithm is globally convergent for continuously differentiable functions and the rate of convergence of the algorithm is one-step superlinear and \(n\)-step second-order for uniformly convex objective functions.
0 references
DFP algorithm
0 references
line search
0 references
convergence
0 references
Davidson-Fletcher-Powell algorithm
0 references
0 references
0 references
0 references
0.9154102
0 references
0.9070077
0 references
0.8925981
0 references
0.88721323
0 references
