scientific article; zbMATH DE number 1310905

MaRDI QIDQ4254734zbMATH OpenFDO

Authors Dachuan Xu

Publication date 5 October 1999

zbMATH Keywords

convex quadratic programmingDennis-Fletcher-Powell algorithmglobal convergencesuperlinear convergencetracing line search

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 238304
• Convergence of the DFP algorithm without exact line search
• scientific article; zbMATH DE number 1210845
• scientific article; zbMATH DE number 4218959
• scientific article; zbMATH DE number 1559038
• Convergence of DFP algorithms without convexity and exact line search assumptions
• scientific article; zbMATH DE number 4112394
• On the convergence property of the DFP algorithm
• Convergence of DFP algorithm
• Superlinear convergence of the DFP algorithm without exact line search

Cited in

(6)

• The revised DFP algorithm without exact line search
• scientific article; zbMATH DE number 4218959 (Why is no real title available?)
• A NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONS
• scientific article; zbMATH DE number 238304 (Why is no real title available?)
• A study of the Dennis-Wolkowicz method on convex functions
• Convergence of the DFP algorithm without exact line search

This page was built for publication:

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