Mathematics – Optimization and Control
Scientific paper
2008-09-07
Mathematics
Optimization and Control
21 pages, 3 figures. A short version of this paper will appear at the 47th IEEE Conference on Decision and Control
Scientific paper
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 probabilistic bounds provide accurate predictions of the heuristic's performance in non-asymptotic scenarios.
Hassibi Babak
Recht Benjamin
Xu Weiyu
No associations
LandOfFree
Necessary and Sufficient Conditions for Success of the Nuclear Norm Heuristic for Rank Minimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Necessary and Sufficient Conditions for Success of the Nuclear Norm Heuristic for Rank Minimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Necessary and Sufficient Conditions for Success of the Nuclear Norm Heuristic for Rank Minimization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-30264