Necessary and Sufficient Conditions for Rank-One-Generated Cones: Two LMIs Are ROG iff a Nonzero Combination of Is PSD or , Research Paper
A quadratically constrained quadratic program (QCQP) minimizes a quadratic function subject to quadratic constraints. Binary integer programs, max-cut, and many robust and polynomial optimization problems can be written this way. Any QCQP has a lifted form in which the vector variable is replaced by the matrix ; dropping the rank constraint on …