Identifying non-active restrictions in convex quadratic programming

DOI10.1007/S001860100145zbMath1031.90020OpenAlexW2010155752MaRDI QIDQ1396999

Peter Recht

Publication date: 16 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860100145

zbMATH Keywords

quadratic programmingredundancyactive set strategyfeasible point algorithms

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items (3)

Redundancies in positive-semidefinite quadratic programming ⋮ 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: Identifying non-active restrictions in convex quadratic programming