Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit

DOI10.1007/s10915-013-9682-3zbMath1275.65024OpenAlexW2012929908MaRDI QIDQ368099

Ming Yan, Yi Yang, Stanley J. Osher

Publication date: 18 September 2013

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-013-9682-3

zbMATH Keywords

algorithmGrassmann manifoldnumerical experimentlow-rank matrixadaptive outlier pursuitrandom-valued noiserobust matrix completion

Mathematics Subject Classification ID

Matrix completion problems (15A83)

Related Items

Robust Low-Rank Matrix Completion by Riemannian Optimization, Low rank prior and total variation regularization for image deblurring

Uses Software

• LMaFit
• RTRMC

Cites Work

• Unnamed Item
• Unnamed Item
• Wavelet frame based blind image inpainting
• An interior-point piecewise linear penalty method for nonlinear programming
• The geometry of graphs and some of its algorithmic applications
• Trust-region methods on Riemannian manifolds
• Exact matrix completion via convex optimization
• Low-Rank Matrix Completion by Riemannian Optimization
• Restoration of Images Corrupted by Impulse Noise and Mixed Gaussian Impulse Noise Using Blind Inpainting
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Robust Video Restoration by Joint Sparse and Low Rank Matrix Approximation
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion
• Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
• A Geometric Approach to Low-Rank Matrix Completion
• Matrix Completion From a Few Entries
• The Power of Convex Relaxation: Near-Optimal Matrix Completion