Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm

  title={Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm},
  author={Canyi Lu and Jinhui Tang and Shuicheng Yan and Zhouchen Lin},
  journal={IEEE Transactions on Image Processing},
The nuclear norm is widely used as a convex surrogate of the rank function in compressive sensing for low rank matrix recovery with its applications in image recovery and signal processing. However, solving the nuclear norm-based relaxed convex problem usually leads to a suboptimal solution of the original rank minimization problem. In this paper, we propose to use a family of nonconvex surrogates of L0-norm on the singular values of a matrix to approximate the rank function. This leads to a… CONTINUE READING
Highly Cited
This paper has 58 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS
26 Extracted Citations
54 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 26 extracted citations

59 Citations

Citations per Year
Semantic Scholar estimates that this publication has 59 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 54 references

Fast sparse regression and classification

  • Jerome Friedman
  • International Journal of Forecasting, 2012.
  • 2012
Highly Influential
9 Excerpts

Nearly unbiased variable selection under minimax concave penalty

  • Cunhui Zhang
  • The Annals of Statistics, 2010.
  • 2010
Highly Influential
5 Excerpts

Analysis of multi-stage convex relaxation for sparse regularization

  • Tong Zhang
  • JMLR, 2010.
  • 2010
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…