Login / Signup

The equivalence of semidefinite relaxations of polynomial 0-1 and +/- 1 programs via scaling.

Kevin K. H. Cheung
Published in: Oper. Res. Lett. (2008)
Keyphrases
  • semidefinite
  • positive semidefinite
  • semidefinite programming
  • sufficient conditions
  • convex relaxation
  • higher dimensional
  • interior point methods
  • linear programming
  • special case
  • high order
  • convex sets