Login / Signup

Semidefinite relaxations of ordering problems.

Philipp HungerländerFranz Rendl
Published in: Math. Program. (2013)
Keyphrases
  • semidefinite
  • semidefinite programming
  • convex relaxation
  • sufficient conditions
  • interior point methods
  • machine learning
  • lower bound
  • pairwise
  • linear programming
  • convex optimization
  • higher dimensional
  • convex sets