Primal-dual method of solving convex quadratic programming problems

MaRDI QIDQ5943631zbMATH OpenFDO

Authors V. Moraru

Publication date 12 March 2003

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

zbMATH Keywords

quadratic programmingsemidefinite programmingNewton's methodprimal-dual method

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Numerical methods involving duality (49M29)

Recommendations

• A new primal-dual polynomial algorithm for convex quadratic programming
• A numerically stable dual method for solving strictly convex quadratic programs
• An unconstrained convex programming approach to solving convex quadratic programming problems
• scientific article; zbMATH DE number 3880447
• A new primal-dual path-following method for convex quadratic programming

Cited in

(11)

• On active-set methods for the quadratic programming problem
• Direct-dual Fejér methods for problems of quadratic programming
• scientific article; zbMATH DE number 847150 (Why is no real title available?)
• Dual support method for solving convex quadratic programs
• scientific article; zbMATH DE number 3880447 (Why is no real title available?)
• Infeasible primal-dual algorithm for minimizing convex quadratic problems
• A numerical method for solving quadratic programming problems with quadratic penalties applied by stages
• scientific article; zbMATH DE number 4115852 (Why is no real title available?)
• The primal algorithm using conjugate directions for quadratic programming problems with simple upper bounds
• On a primal-dual Newton proximal method for convex quadratic programs
• A dual gradient-projection method for large-scale strictly convex quadratic problems

This page was built for publication: Primal-dual method of solving convex quadratic programming problems

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