Dual Smoothing and Level Set Techniques for Variational Matrix Decomposition
arXiv:1603.00284
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.
38 pages, 10 figures. arXiv admin note: text overlap with arXiv:1406.1089
References in corpus (6)
- Convex Optimization for Big Data
- Adaptive Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems
- Linearized Alternating Direction Method with Adaptive Penalty and Warm Starts for Fast Solving Transform Invariant Low-Rank Textures
- A variational approach to stable principal component pursuit
- Variational properties of value functions
- An Algorithm for Splitting Parallel Sums of Linearly Composed Monotone Operators, with Applications to Signal Recovery