Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
From MaRDI portal
(Redirected from Publication:368099)
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
Cites work
- scientific article; zbMATH DE number 5161643 (Why is no real title available?)
- A Geometric Approach to Low-Rank Matrix Completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- An interior-point piecewise linear penalty method for nonlinear programming
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Low-rank matrix completion by Riemannian optimization
- Matrix Completion From a Few Entries
- Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
- Restoration of images corrupted by impulse noise and mixed Gaussian impulse noise using blind inpainting
- Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
- Robust principal component analysis?
- Robust video restoration by joint sparse and low rank matrix approximation
- Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The geometry of graphs and some of its algorithmic applications
- Trust-region methods on Riemannian manifolds
- Wavelet frame based blind image inpainting
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
- Robust inexact alternating optimization for matrix completion with outliers
- Low-Rank Matrix Recovery Via Robust Outlier Estimation
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)
