scientific article; zbMATH DE number 1310905

zbMATH Open0927.65072MaRDI QIDQ4254734

Dachuan Xu

Publication date: 5 October 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

global convergenceconvex quadratic programmingsuperlinear convergenceDennis-Fletcher-Powell algorithmtracing line search

Mathematics Subject Classification ID

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

Related Items (4)

Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Convergence of the DFP algorithm without exact line search ⋮ The revised DFP algorithm without exact line search

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the convergence property of the DFP algorithm 👍 👎
• Convergence of DFP algorithm 👍 👎
• Convergence of DFP algorithms without convexity and exact line search assumptions 👍 👎
• Superlinear convergence of the DFP algorithm without exact line search 👍 👎
• 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)