Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements
From MaRDI portal
Publication:2662546
DOI10.1016/j.amc.2020.125702OpenAlexW3092119210MaRDI QIDQ2662546
Massimo Fornasier, Johannes Maly, Valeriya Naumova
Publication date: 14 April 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.06240
multi-penalty regularizationbilinear compressed sensingiterative soft-thresholding (LASSO)low-rank and sparse recovery
Related Items (2)
Robust sensing of low-rank matrices with non-orthogonal sparse decomposition ⋮ Riemannian thresholding methods for row-sparse and low-rank matrix recovery
Cites Work
- Iterative hard thresholding for compressed sensing
- Global error bounds for piecewise convex polynomials
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Dimension reduction by random hyperplane tessellations
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Exact matrix completion via convex optimization
- Sparsity-enforcing regularisation and ISTA revisited
- Conditions on optimal support recovery in unmixing problems by means of multi-penalty regularization
- One-Bit Compressed Sensing by Linear Programming
- Suprema of Chaos Processes and the Restricted Isometry Property
- Minimization of multi-penalty functionals by alternating iterative thresholding and optimal parameter choices
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- Blind Deconvolution Using Convex Programming
- Blind Recovery of Sparse Signals From Subsampled Convolution
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Blind Demixing and Deconvolution at Near-Optimal Rate
- Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
- Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Learning the parts of objects by non-negative matrix factorization
- Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
- Low-rank matrix completion using alternating minimization
This page was built for publication: Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements
