Superlinear convergence of the DFP algorithm without exact line search

DOI10.1007/BF02677389MaRDI QIDQ5949537zbMATH OpenOpenAlexFDO

Authors Dingguo Pu

Publication date 20 January 2003

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02677389

zbMATH Keywords

nonlinear programmingline searchglobally convergent\(Q\)-superlinearly convergent

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Recommendations

• Convergence of the DFP algorithm without exact line search
• The revised DFP algorithm without exact line search
• scientific article; zbMATH DE number 4112394
• Convergence Properties of the DFP Algorithm for Unconstrained Optimization
• scientific article; zbMATH DE number 1185967

Cites work

• scientific article; zbMATH DE number 3529352 (Why is no real title available?)
• scientific article; zbMATH DE number 232393 (Why is no real title available?)
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• On the Convergence of the Variable Metric Algorithm
• On the convergence property of the DFP algorithm
• The convergence of Broyden algorithms for LC gradient function

Cited in

(7)

• scientific article; zbMATH DE number 682565 (Why is no real title available?)
• scientific article; zbMATH DE number 4048294 (Why is no real title available?)
• scientific article; zbMATH DE number 1310905 (Why is no real title available?)
• A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence
• Convergence of the DFP algorithm without exact line search
• The revised DFP algorithm without exact line search
• On the Local and Superlinear Convergence of a Parameterized DFP Method

This page was built for publication: Superlinear convergence of the DFP algorithm without exact line search

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