Redundancies in positive-semidefinite quadratic programming

DOI10.1023/B:JOTA.0000006689.99237.44zbMath1061.90089OpenAlexW2033074361MaRDI QIDQ597191

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

parametric optimizationredundancyfeasible-point algorithmsPositive-semidefinite quadratic programming

Mathematics Subject Classification ID

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

Related Items (2)

Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming ⋮ Characterization of optimal points in binary convex quadratic programming

Cites Work

• Identifying non-active restrictions in convex quadratic programming
• On the continuity of the minimum in parametric quadratic programs
• Unnamed Item

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