Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
DOI10.1007/S10915-013-9682-3zbMATH Open1275.65024OpenAlexW2012929908MaRDI QIDQ368099FDOQ368099
Authors: Ming Yan, Stanley Osher, Yi Yang 
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
Recommendations
- Robust inexact alternating optimization for matrix completion with outliers
- Matrix completion with noisy entries and outliers
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- A generalized robust minimization framework for low-rank matrix recovery
- Matrix completion with sparse measurement errors
Grassmann manifoldalgorithmnumerical experimentlow-rank matrixadaptive outlier pursuitrandom-valued noiserobust matrix completion
Cites Work
- Trust-region methods on Riemannian manifolds
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Matrix Completion From a Few Entries
- The geometry of graphs and some of its algorithmic applications
- Low-rank matrix completion by Riemannian optimization
- Restoration of images corrupted by impulse noise and mixed Gaussian impulse noise using blind inpainting
- Wavelet frame based blind image inpainting
- Robust video restoration by joint sparse and low rank matrix approximation
- Title not available (Why is that?)
- 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
- Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
- An interior-point piecewise linear penalty method for nonlinear programming
Cited In (12)
- A generalized robust minimization framework for low-rank matrix recovery
- Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent
- Matrix completion with noisy entries and outliers
- Robust low-rank matrix completion by Riemannian optimization
- Low rank matrix recovery with adversarial sparse noise
- Using side information to reliably learn low-rank matrices from missing and corrupted observations
- Matrix completion with column outliers and sparse noise
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- Low rank prior and total variation regularization for image deblurring
- Convex optimization techniques for the efficient recovery of a sparsely corrupted low-rank matrix
- Low-Rank Matrix Recovery Via Robust Outlier Estimation
- Robust inexact alternating optimization for matrix completion with outliers
Uses Software
This page was built for publication: Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368099)
