Login / Signup

Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques.

Felix LiederFatemeh Bani Asadi RadFlorian Jarre
Published in: Comput. Optim. Appl. (2015)
Keyphrases
  • semidefinite
  • semidefinite programming
  • convex relaxation
  • interior point methods
  • small number
  • sufficient conditions
  • special case
  • optimization problems
  • shape analysis
  • convex optimization