A Tight Semidefinite Relaxation of the MAX CUT Problem.
Hongwei LiuSanyang LiuFengmin XuPublished in: J. Comb. Optim. (2003)
Keyphrases
- semidefinite
- semidefinite programming
- convex relaxation
- lower bound
- sufficient conditions
- higher dimensional
- upper bound
- worst case
- interior point methods
- np hard
- convex sets
- kernel matrix
- maximum likelihood
- convex optimization
- feature selection
- linear programming
- principal component analysis
- evolutionary algorithm
- feature extraction