On the convergence property of the DFP algorithm (Q803046): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Pu, Dingguo / rank
Normal rank
 
Property / author
 
Property / author: Wen-Ci Yu / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Marco Gaviano / rank
Normal rank
 
Property / author
 
Property / author: Pu, Dingguo / rank
 
Normal rank
Property / author
 
Property / author: Wen-Ci Yu / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Marco Gaviano / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rapidly Convergent Descent Method for Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of the Variable Metric Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798160 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:56, 21 June 2024

scientific article
Language Label Description Also known as
English
On the convergence property of the DFP algorithm
scientific article

    Statements

    On the convergence property of the DFP algorithm (English)
    0 references
    0 references
    1990
    0 references
    The authors investigate the convergence of the well-known Davidon- Fletcher-Powell algorithm for solving unconstrained minimization problems, i.e. min f(x), \(x\in R^ n\). The main result is: Suppose that \(f\in C^{1,1}\) and the sequence \(\{x_ k\}\) generated by the algorithm tends to \(x^*\), then \(\nabla f(x^*)=0\). Note that no convexity assumption is required on f.
    0 references
    0 references
    convergence
    0 references
    Davidon-Fletcher-Powell algorithm
    0 references
    unconstrained minimization
    0 references
    0 references
    0 references
    0 references