Lectures on Modern Convex Optimization III: The Convex Hull of Conic Quadratic Representable SetsTextbook
Conic quadratic programs (second-order cone programs) minimize a linear objective subject to finitely many constraints of the form . They are solved by interior-point methods in polynomial time, and a large share of convex models in engineering, statistics and robust optimization can be rewritten in this form. Whether a given convex…