Compressed sensing of low-rank plus sparse matrices

DOI10.1016/j.acha.2023.01.008OpenAlexW3043164876MaRDI QIDQ2689144

Simon Vary, Jared Tanner

Publication date: 9 March 2023

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.09457

zbMATH Keywords

robust PCArestricted isometry propertymatrix sensinglow-rank plus sparse matrixnon-convex methods

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Iterative numerical methods for linear systems (65F10) Approximation with constraints (41A29) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Uses Software

• SDPT3
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• A mathematical introduction to compressive sensing
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Exact support recovery for sparse spikes deconvolution
• A simple proof of the restricted isometry property for random matrices
• Matrix recipes for hard thresholding methods
• Exact matrix completion via convex optimization
• Normalized Iterative Hard Thresholding for Matrix Completion
• Performance comparisons of greedy algorithms in compressed sensing
• Robust principal component analysis?
• Rank-Sparsity Incoherence for Matrix Decomposition
• New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
• 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
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
• Accelerated Alternating Projections for Robust Principal Component Analysis
• Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion
• The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
• Robust Matrix Decomposition With Sparse Corruptions
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Model-Based Compressive Sensing
• Towards a Mathematical Theory of Super‐resolution
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing