Convergence of DFP algorithm

MaRDI QIDQ1908612zbMATH OpenFDO

Authors Yaxiang Yuan

Publication date 4 March 1996

Published in Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

algorithmsconvergenceglobal convergenceunconstrained optimizationquasi-Newton methodDavidon-Fletcher-Powell methodDFP method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 4218959
• On the convergence property of the DFP algorithm
• scientific article; zbMATH DE number 1185967
• scientific article; zbMATH DE number 238304
• scientific article; zbMATH DE number 4112394

Cited in

(11)

• On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables
• scientific article; zbMATH DE number 4112394 (Why is no real title available?)
• scientific article; zbMATH DE number 1185967 (Why is no real title available?)
• scientific article; zbMATH DE number 1310905 (Why is no real title available?)
• scientific article; zbMATH DE number 238304 (Why is no real title available?)
• Convergence of the DFP algorithm without exact line search
• An overview of nonlinear optimization
• Convergence Properties of the DFP Algorithm for Unconstrained Optimization
• The projection technique for two open problems of unconstrained optimization problems
• scientific article; zbMATH DE number 4218959 (Why is no real title available?)
• scientific article; zbMATH DE number 1559038 (Why is no real title available?)

This page was built for publication: Convergence of DFP algorithm

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