Login / Signup

An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem.

Renata Sotirov
Published in: INFORMS J. Comput. (2014)
Keyphrases
  • semidefinite programming
  • semidefinite
  • linear programming
  • interior point methods
  • kernel matrix
  • primal dual
  • maximum margin
  • objective function
  • feature space
  • knn
  • linear program