Login / Signup

Burer's key assumption for semidefinite and doubly nonnegative relaxations.

Florian Jarre
Published in: Optim. Lett. (2012)
Keyphrases
  • semidefinite
  • semidefinite programming
  • convex relaxation
  • linear programming
  • sufficient conditions
  • higher dimensional
  • interior point methods
  • training data
  • np hard
  • convex sets