Login / Signup

Semidefinite relaxations for partitioning, assignment and ordering problems.

Franz Rendl
Published in: 4OR (2012)
Keyphrases
  • semidefinite
  • convex relaxation
  • semidefinite programming
  • sufficient conditions
  • higher dimensional
  • interior point methods
  • convex optimization
  • learning algorithm
  • high dimensional
  • convex sets