Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem.
Ting Kei PongHao SunNingchuan WangHenry WolkowiczPublished in: Comput. Optim. Appl. (2016)
Keyphrases
- quadratic programming
- semidefinite programming
- linear programming
- semidefinite
- objective function
- interior point methods
- linear program
- primal dual
- quadratically constrained quadratic
- np hard
- least squares
- lower bound
- optimal solution
- kernel matrix
- ls svm
- support vector machine
- dynamic programming
- machine learning
- data sets
- dimensionality reduction