Robust principal component pursuit via inexact alternating minimization on matrix manifolds
DOI10.1007/s10851-014-0527-yzbMath1329.15056OpenAlexW1976218807WikidataQ115155137 ScholiaQ115155137MaRDI QIDQ2515360
Publication date: 31 July 2015
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: http://edoc.hu-berlin.de/18452/14349
image processingRiemannian manifoldsparse matrixmatrix decompositionlow-rank matrixalternating minimizationoptimization on manifolds
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Methods of local Riemannian geometry (53B21) Matrix completion problems (15A83)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- TILT: transform invariant low-rank textures
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Grassmann algorithms for low rank approximation of matrices with missing values
- Exact matrix completion via convex optimization
- Low-Rank Matrix Completion by Riemannian Optimization
- Projection-like Retractions on Matrix Manifolds
- Manopt, a Matlab toolbox for optimization on manifolds
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Rank-Sparsity Incoherence for Matrix Decomposition
- Robust Video Restoration by Joint Sparse and Low Rank Matrix Approximation
- The Geometry of Algorithms with Orthogonality Constraints
- Matrix Completion From a Few Entries
- Alternating Projections on Manifolds
This page was built for publication: Robust principal component pursuit via inexact alternating minimization on matrix manifolds