Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions

DOI10.1007/s40305-013-0010-2zbMath1288.65091OpenAlexW2020503492MaRDI QIDQ384215

Yin Zhang

Publication date: 27 November 2013

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-013-0010-2

zbMATH Keywords

stabilityprior informationcompressive sensingrecoverability\(\ell_1\)-minimizationnon-restricted isometry propertyuniform recoverability

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Sampling theory in information and communication theory (94A20)

Related Items (24)

Computation of sparse and dense equilibrium strategies of evolutionary games ⋮ One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations ⋮ Moment Tensor Potentials: A Class of Systematically Improvable Interatomic Potentials ⋮ A survey on compressive sensing: classical results and recent advancements ⋮ 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory ⋮ \(s\)-goodness for low-rank matrix recovery ⋮ Heuristics for Finding Sparse Solutions of Linear Inequalities ⋮ Sorted \(L_1/L_2\) minimization for sparse signal recovery ⋮ Sharp non-asymptotic performance bounds for \(\ell_1\) and Huber robust regression estimators ⋮ A null-space-based weightedl₁minimization approach to compressed sensing ⋮ Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets ⋮ Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications ⋮ Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing ⋮ The sparsest solutions to \(Z\)-tensor complementarity problems ⋮ Necessary and sufficient conditions of solution uniqueness in 1-norm minimization ⋮ Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere ⋮ A Scale-Invariant Approach for Sparse Signal Recovery ⋮ A hybrid splitting method for smoothing Tikhonov regularization problem ⋮ Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction ⋮ Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization ⋮ Minimization of $\ell_{1-2}$ for Compressed Sensing ⋮ Sparse Solutions of a Class of Constrained Optimization Problems ⋮ An analysis of noise folding for low-rank matrix recovery ⋮ The sparsest solution to the system of absolute value equations

Uses Software

• PDCO
• CoSaMP

Cites Work

• The restricted isometry property and its implications for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution
• A simple proof of the restricted isometry property for random matrices
• Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
• Compressed sensing and best 𝑘-term approximation
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Linear Inversion of Band-Limited Reflection Seismograms
• Atomic Decomposition by Basis Pursuit
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions