On the tightness of SDP relaxations of QCQPs.
Alex L. WangFatma Kilinç-KarzanPublished in: Math. Program. (2022)
Keyphrases
- semidefinite
- lower bound
- semidefinite programming
- semi definite programming
- convex relaxation
- linear programming
- semi infinite
- quadratically constrained quadratic
- sufficient conditions
- np hard
- interior point methods
- convex optimization
- higher dimensional
- convex sets
- machine learning
- linear programming relaxation
- metric learning
- objective function
- training data