Semidefinite Programming Relaxations for the Graph Partitioning Problem.
Henry WolkowiczQing ZhaoPublished in: Discret. Appl. Math. (1999)
Keyphrases
- graph partitioning
- semidefinite programming
- semidefinite
- linear programming
- quadratically constrained quadratic
- interior point methods
- graph model
- image segmentation
- clustering algorithm
- interior point
- weighted graph
- primal dual
- kernel matrix
- maximum margin
- spectral clustering
- normalized cut
- data clustering
- linear program
- belief propagation
- generative model
- dynamic programming
- convex relaxation
- special case
- lower bound
- bayesian networks
- learning algorithm