19 citations · 23 across the 13 of their papers we have counts for
4 papers · 1 filter
A Geometric View of SDP Exactness in QCQPs and its Applications
Alex L. Wang, Fatma Kilinc-Karzan
Quadratically constrained quadratic programs (QCQPs) are a highly expressive class of nonconvex optimization problems. While QCQPs are NP-hard in general, they admit a natural conv…
Necessary and sufficient conditions for rank-one generated cones
C. J. Argue, Fatma Kılınç-Karzan, Alex L. Wang
A closed convex conic subset of the positive semidefinite (PSD) cone is rank-one generated (ROG) if all of its extreme rays are generated by rank-one matrices. The RO…
Weighted Cheeger and Buser Inequalities, with Applications to Clustering and Cutting Probability Densities
Timothy Chu, Gary L. Miller, Noel J. Walkington +1
In this paper, we show how sparse or isoperimetric cuts of a probability density function relate to Cheeger cuts of its principal eigenfunction, for appropriate definitions of `spa…
On convex hulls of epigraphs of QCQPs
Alex L. Wang, Fatma Kilinc-Karzan
Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems well-known to be NP-hard in general. In this paper we study sufficient conditi…