Compressed sensing and matrix completion with constant proportion of corruptions
From MaRDI portal
Publication:1939501
DOI10.1007/s00365-012-9176-9zbMath1258.93076arXiv1104.1041MaRDI QIDQ1939501
Publication date: 4 March 2013
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1041
convex optimization; matrix completion; compressed sensing; robust PCA; restricted isometry property; golfing scheme
62G35: Nonparametric robustness
90C25: Convex programming
93C57: Sampled-data control/observation systems
93E20: Optimal stochastic control
49J55: Existence of optimal solutions to problems involving randomness
Related Items
Super-resolution of point sources via convex programming, Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations, A general theory for subspace-sparse recovery, Unnamed Item, Convergence analysis of the augmented Lagrange multiplier algorithm for a class of matrix compressive recovery, Robust matrix completion, Two modified augmented Lagrange multiplier algorithms for Toeplitz matrix compressive recovery, Robust bilinear factorization with missing and grossly corrupted observations, Robust group lasso: model and recoverability, Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization, Robust low-rank matrix estimation, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence, Recovery guarantees for polynomial coefficients from weakly dependent data with outliers, Outlier detection in networks with missing links, Stable restoration and separation of approximately sparse signals, Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class, Correcting for unknown errors in sparse high-dimensional function approximation, Phaselift is robust to a constant fraction of arbitrary errors, Robust Low-Rank Matrix Completion by Riemannian Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- Democracy in action: quantization, saturation, and compressive sensing
- User-friendly tail bounds for sums of random matrices
- Near-ideal model selection by \(\ell _{1}\) minimization
- A simple proof of the restricted isometry property for random matrices
- Random vectors in the isotropic position
- Exact matrix completion via convex optimization
- Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
- Robust principal component analysis?
- Rank-Sparsity Incoherence for Matrix Decomposition
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Compressive Sensing by Random Convolution
- Atomic Decomposition by Basis Pursuit
- Strong converse for identification via quantum channels
- Robust PCA via Outlier Pursuit
- Recovery of Sparsely Corrupted Signals
- Robust Matrix Decomposition With Sparse Corruptions
- A Probabilistic and RIPless Theory of Compressed Sensing
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Dense Error Correction Via $\ell^1$-Minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- A Simpler Approach to Matrix Completion
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
