A new semidefinite programming relaxation scheme for a class of quadratic matrix problems.
Amir BeckYoel DroriMarc TeboullePublished in: Oper. Res. Lett. (2012)
Keyphrases
- semidefinite
- semidefinite programming
- linear matrix inequality
- symmetric matrix
- positive semidefinite
- linear programming
- block diagonal
- quadratically constrained quadratic
- interior point methods
- interior point
- convex relaxation
- kernel matrix
- primal dual
- maximum margin
- semi definite programming
- sufficient conditions
- quadratic function
- linear program
- machine learning
- convex optimization
- support vector
- objective function