Null space conditions and thresholds for rank minimization

  • Recht B
  • Xu W
  • Hassibi B
  • 49


    Mendeley users who have this article in their library.
  • 62


    Citations of this article.


Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This class of optimization problems, known as rank minimization, is NP-hard, and for most practical problems there are no efficient algorithms that yield exact solutions. A popular heuristic replaces the rank function with the nuclear norm-equal to the sum of the singular values-of the decision variable and has been shown to provide the optimal low rank solution in a variety of scenarios. In this paper, we assess the practical performance of this heuristic for finding the minimum rank matrix subject to linear equality constraints. We characterize properties of the null space of the linear operator defining the constraint set that are necessary and sufficient for the heuristic to succeed. We then analyze linear constraints sampled uniformly at random, and obtain dimension-free bounds under which our null space properties hold almost surely as the matrix dimensions tend to infinity. Finally, we provide empirical evidence that these probabilistic bounds provide accurate predictions of the heuristic's performance in non-asymptotic scenarios. © 2010 Springer and Mathematical Optimization Society.

Author-supplied keywords

  • Compressed sensing
  • Convex optimization
  • Gaussian processes
  • Matrix norms
  • Random matrices
  • Rank

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Benjamin Recht

  • Weiyu Xu

  • Babak Hassibi

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free