Convergence of fixed-point continuation algorithms for matrix rank minimization

Details Convergence of fixed-point continuation algorithms for matrix rank minimization Convergence of fixed-point continuation algorithms for matrix rank minimization

2009-06-18

arxiv.org/abs/0906.3499v4

Mathematics

Optimization and Control

Conditions on RIP constant for an approximate recovery are improved

Scientific paper

The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding, etc. As this problem is NP-hard in general, its convex relaxation, the nuclear norm minimization problem, is often solved instead. Recently, Ma, Goldfarb and Chen proposed a fixed-point continuation algorithm for solving the nuclear norm minimization problem. By incorporating an approximate singular value decomposition technique in this algorithm, the solution to the matrix rank minimization problem is usually obtained. In this paper, we study the convergence/recoverability properties of the fixed-point continuation algorithm and its variants for matrix rank minimization. Heuristics for determining the rank of the matrix when its true rank is not known are also proposed. Some of these algorithms are closely related to greedy algorithms in compressed sensing. Numerical results for these algorithms for solving affinely constrained matrix rank minimization problems are reported.

Affiliated with

Also associated with

No associations

Rating

Convergence of fixed-point continuation algorithms for matrix 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 Convergence of fixed-point continuation algorithms for matrix rank minimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence of fixed-point continuation algorithms for matrix rank minimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-725871