Redundancies in positive-semidefinite quadratic programming

DOI10.1023/B:JOTA.0000006689.99237.44MaRDI QIDQ597191zbMATH OpenOpenAlexFDO

Authors Peter Recht

Publication date 6 August 2004

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:jota.0000006689.99237.44

zbMATH Keywords

feasible-point algorithmsparametric optimizationPositive-semidefinite quadratic programmingredundancy

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Identifying non-active restrictions in convex quadratic programming
• Detecting superfluous constraints in quadratic programming by varying the optimal point of the unrestricted problem
• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• A dual-active-set algorithm for positive semi-definite quadratic programming
• Characterization of optimal points in binary convex quadratic programming

Cites work

• scientific article; zbMATH DE number 3791104 (Why is no real title available?)
• Identifying non-active restrictions in convex quadratic programming
• On the continuity of the minimum in parametric quadratic programs

Cited in

(5)

• Role of redundant constraints for improving dual bounds in polynomial optimization problems
• Identifying non-active restrictions in convex quadratic programming
• Detecting superfluous constraints in quadratic programming by varying the optimal point of the unrestricted problem
• Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming
• Characterization of optimal points in binary convex quadratic programming

This page was built for publication: Redundancies in positive-semidefinite quadratic programming

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