Login / Signup

Efficient rank minimization to tighten semidefinite programming for unconstrained binary quadratic optimization.

Roman PogodinMikhail KrechetovYury Maximov
Published in: Allerton (2017)
Keyphrases
  • semidefinite programming
  • interior point methods
  • linear programming
  • kernel matrix
  • feature extraction
  • distance measure
  • least squares
  • higher order
  • primal dual
  • maximum margin