2000 character limit reached
Dual Smoothing and Level Set Techniques for Variational Matrix Decomposition (1603.00284v1)
Published 1 Mar 2016 in stat.ML, cs.CV, and math.OC
Abstract: We focus on the robust principal component analysis (RPCA) problem, and review a range of old and new convex formulations for the problem and its variants. We then review dual smoothing and level set techniques in convex optimization, present several novel theoretical results, and apply the techniques on the RPCA problem. In the final sections, we show a range of numerical experiments for simulated and real-world problems.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.