19 citations · 23 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
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…
cs.DS2019★ 19 cited
The Generalized Trust Region Subproblem: solution complexity and convex hull results
Alex L. Wang, Fatma Kilinc-Karzan
We consider the Generalized Trust Region Subproblem (GTRS) of minimizing a nonconvex quadratic objective over a nonconvex quadratic constraint. A lifting of this problem recasts th…