Convergence of DFP algorithm

zbMATH Open0840.65051MaRDI QIDQ1908612FDOQ1908612

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)

Cited In (9)

• On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• On the convergence property of the DFP algorithm 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)