Login / Signup

Efficient Rank Minimization to Tighten Semidefinite Programming for Unconstrained Binary Quadratic Optimization.

Roman PogodinMikhail KrechetovYury Maximov
Published in: CoRR (2017)
Keyphrases
  • semidefinite programming
  • interior point methods
  • linear programming
  • data sets
  • primal dual
  • kernel matrix
  • learning algorithm
  • small number
  • distance measure
  • model selection