Characterization of optimal points in binary convex quadratic programming

DOI10.1080/02331930600815801zbMath1119.90035OpenAlexW2003286932MaRDI QIDQ5758206

Peter Recht

Publication date: 3 September 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930600815801

zbMATH Keywords

quadratic programmingsuperfluous restrictions

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Boolean programming (90C09)

Cites Work

• Unnamed Item
• Redundancies in positive-semidefinite quadratic programming
• Identifying non-active restrictions in convex quadratic programming
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations

This page was built for publication: Characterization of optimal points in binary convex quadratic programming