Faster, but weaker, relaxations for quadratically constrained quadratic programs.

Samuel Burer Sunyoung Kim Masakazu Kojima

Published in: Comput. Optim. Appl. (2014)

Keyphrases

quadratically constrained quadratic
semidefinite programming
interior point methods
convex optimization
semi infinite
kernel learning
linear programming
semidefinite
semidefinite program
semi definite programming
lower bound
linear program
np hard
primal dual
dimensionality reduction
low rank