Necessary and Sufficient Conditions for Rank-One-Generated Cones

Abstract

A closed convex conic subset [Formula: see text] of the positive semidefinite (PSD) cone is rank-one generated (ROG) if all of its extreme rays are generated by rank-one matrices. The ROG property of [Formula: see text] is closely related to the exactness of semidefinite program (SDP) relaxations of nonconvex quadratically constrained quadratic programs (QCQPs) related to [Formula: see text]. We consider the case where [Formula: see text] is obtained as the intersection of the PSD cone with finitely many homogeneous linear matrix inequalities and conic constraints and identify sufficient conditions that guarantee that [Formula: see text] is ROG. Our general framework allows us to recover a number of well-known results from the literature. In the case of two linear matrix inequalities, we also establish the necessity of our sufficient conditions. This extends one of the few settings from the literature—the case of one linear matrix inequality and the S-lemma—where an explicit characterization for the ROG property exists. Finally, we show how our ROG results on cones can be translated into inhomogeneous SDP exactness results and convex hull descriptions in the original space of a QCQP. We close with a few applications of these results; specifically, we recover the well-known perspective reformulation of a simple mixed-binary set via the ROG toolkit. Funding: This work was supported by the Office of Naval Research [Grant N00014-19-1-2321] with the National Science Foundation (NSF) Division of Civil, Mechanical and Manufacturing Innovation [Grant CMMI-1454548] and Frank A. and Helen E. Risch Faculty Development Chair. Part of this work was done while the second author was visiting the Simons Institute for the Theory of Computing, which was partially supported by the DIMACS/Simons Collaboration on Bridging Continuous and Discrete Optimization through the NSF Division of Computing and Communication Foundations [Grant CCF-1740425].