Superlinear convergence of the DFP algorithm without exact line search

DOI10.1007/BF02677389zbMath1002.90068OpenAlexW184212290MaRDI QIDQ5949537

Pu, Dingguo

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 programming\(Q\)-superlinearly convergentglobally convergentline search

Mathematics Subject Classification ID

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

Cites Work

• On the convergence property of the DFP algorithm
• The convergence of Broyden algorithms for LC gradient function
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• On the Convergence of the Variable Metric Algorithm
• Unnamed Item
• Unnamed Item

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