Sparse recovery with pre-Gaussian random matrices

DOI10.4064/SM200-1-6MaRDI QIDQ3066329zbMATH OpenOpenAlexFDO

Authors Simon Foucart, Ming-Jun Lai

Publication date 10 January 2011

Published in Studia Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4064/sm200-1-6

zbMATH Keywords

\(\ell_1\)-minimization\(s\)-sparse solutionspre-Gaussian random matricessparse recoveryunderdetermined system of linear equations

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) Random matrices (algebraic aspects) (15B52) Probabilistic methods in Banach space theory (46B09) Random matrices (probabilistic aspects) (60B20)

Recommendations

• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Nonuniform sparse recovery with subgaussian matrices
• Simple bounds for recovering low-complexity models
• Decoding by Linear Programming

Cited in

(21)

• The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
• A Rice method proof of the null-space property over the Grassmannian
• Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
• Compressed data separation via dual frames based split-analysis with Weibull matrices
• Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
• The sparsity of LASSO-type minimizers
• Iterative hard thresholding for low-rank recovery from rank-one projections
• Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
• Nonuniform sparse recovery with subgaussian matrices
• Stability of \(l_q\)-analysis based dual frame with Weibull matrices for \(0<q\leq 1\)
• Sparsity and non-Euclidean embeddings
• Sparse recovery from saturated measurements
• Flavors of compressive sensing
• Sparse signal recovery using a new class of random matrices
• Jointly low-rank and bisparse recovery: questions and partial answers
• The probabilistic estimates on the largest and smallest q-singular values of random matrices
• The null space property for sparse recovery from multiple measurement vectors
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
• Sparse recovery properties of discrete random matrices
• Dictionary-sparse recovery via thresholding-based algorithms
• Duality theory on generalized singular values and its applications

This page was built for publication: Sparse recovery with pre-Gaussian random matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066329)