ZERO Lab
Home
News
People
Publications
Contact
Linear programming
Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squared Minimization
We presents a general framework for solving the low-rank and/or sparse matrix minimization problems, which may involve multiple nonsmooth terms.
Cite
×