On the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings.
Sabine BurgdorfMonique LaurentTeresa PiovesanPublished in: TQC (2015)
Keyphrases
- semidefinite
- positive semidefinite
- positive semidefinite matrices
- semidefinite programming
- closed form
- complementarity problems
- convex relaxation
- interior point methods
- convex sets
- similarity function
- sufficient conditions
- linear combination
- kernel function
- linear systems
- higher dimensional
- small number
- metric learning
- kernel methods
- linear programming