An alternating direction method with increasing penalty for stable principal component pursuit
From MaRDI portal
Publication:493688
DOI10.1007/s10589-015-9736-6zbMath1326.90061arXiv1309.6553OpenAlexW1966735762MaRDI QIDQ493688
Publication date: 4 September 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.6553
convex optimizationmatrix completionprincipal component analysisalternating direction method of multiplierscompressed sensingvariable penalty
Related Items
Alternating proximal gradient method for convex minimization ⋮ Efficient algorithms for robust and stable principal component pursuit problems ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Fast alternating linearization methods for minimizing the sum of two convex functions
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- A variable-penalty alternating directions method for convex optimization
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- Efficient algorithms for robust and stable principal component pursuit problems
- A unified approach for minimizing composite norms
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Robust principal component analysis?
- Rank-Sparsity Incoherence for Matrix Decomposition
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Numerical Optimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
