Login / Signup

An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem.

Luigi GrippoLaura PalagiVeronica Piccialli
Published in: Math. Program. (2011)
Keyphrases
  • low rank
  • objective function
  • high order
  • rank minimization
  • pairwise
  • missing data
  • clustering method
  • matrix factorization
  • least squares
  • approximation methods
  • minimization problems