Sciweavers

Share
CDC
2008
IEEE

Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization

9 years 3 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, 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 algorithm replaces the rank function with the nuclear norm--equal to the sum of the singular values--of the decision variable. In this paper, we provide a necessary and sufficient condition that quantifies when this heuristic successfully finds the minimum rank solution of a linear constraint set. We additionally provide a probability distribution over instances of the affine rank minimization problem such that instances sampled from this distribution satisfy our conditions for success with overwhelming probability provided the number of constraints is appropriately large. Finally, we give empirical evidence that these probabil...
Benjamin Recht, Weiyu Xu, Babak Hassibi
Added 07 Dec 2010
Updated 07 Dec 2010
Type Conference
Year 2008
Where CDC
Authors Benjamin Recht, Weiyu Xu, Babak Hassibi
Comments (0)
books