Convergence Properties of the DFP Algorithm for Unconstrained Optimization

DOI10.1080/023319302900009865MaRDI QIDQ4804982zbMATH OpenOpenAlexFDO

Authors Lili Jing, Lixing Han, Guanghui Liu

Publication date 8 May 2003

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/023319302900009865

zbMATH Keywords

DFP algorithmglobal convergencestrong Wolfe-type line searchunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)

Recommendations

• Convergence of DFP algorithm
• scientific article; zbMATH DE number 4218959
• A NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONS
• The revised DFP algorithm without exact line search
• scientific article; zbMATH DE number 238304

Cited in

(8)

• Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
• A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
• scientific article; zbMATH DE number 1547738 (Why is no real title available?)
• A NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONS
• Convergence analysis of the self-dual optimally conditioned ssvm method of oren-spedicato
• Superlinear convergence of the DFP algorithm without exact line search
• Convergence of the DFP algorithm without exact line search
• On the convergence property of the DFP algorithm

This page was built for publication: Convergence Properties of the DFP Algorithm for Unconstrained Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804982)