Showing math.OCShow all
3 papers · 1 filter
math.OC2021
Exactness in SDP relaxations of QCQPs: Theory and applications
Fatma Kılınç-Karzan, Alex L. Wang
Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems. In a QCQP, we are asked to minimize a (possibly nonconvex) quadratic function…
math.OC2020
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…
math.OC2019
On the tightness of SDP relaxations 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 conditions under w…