Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction
From MaRDI portal
Publication:5219713
DOI10.1287/moor.2017.0919zbMath1441.90091arXiv1710.10883OpenAlexW2963799998MaRDI QIDQ5219713
Zhi-Quan Luo, Houyuan Jiang, Yun-bin Zhao
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.10883
convex optimizationlinear programweak stabilitysparsity optimization\( \ell_1\)-minimizationweak range space property
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Inverse problems in linear algebra (15A29)
Related Items
Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms, Stability of 1-bit compressed sensing in sparse data reconstruction, Stability analysis of a class of sparse optimization problems, Sparse Solutions of a Class of Constrained Optimization Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The gap between the null space property and the restricted isometry property
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- A mathematical introduction to compressive sensing
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- The restricted isometry property and its implications for compressed sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- A better approximation for balls
- Bounds for error in the solution set of a perturbed linear program
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Metric entropy of some classes of sets with differentiable boundaries
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- On the Theorem of Uniform Recovery of Random Sampling Matrices
- Necessary and sufficient conditions for linear convergence of ℓ1-regularization
- Compressed sensing and best 𝑘-term approximation
- On Sparse Representations in Arbitrary Redundant Bases
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Sparse representations in unions of bases
- Greed is Good: Algorithmic Results for Sparse Approximation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On Polar Polytopes and the Recovery of Sparse Representations
- Sparse and Redundant Representations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Signal Recovery and the Large Sieve
- Atomic Decomposition by Basis Pursuit
- Minimum-support solutions of polyhedral concave programs*
- Uncertainty principles and ideal atomic decomposition
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- A New Computational Method for the Sparsest Solutions to Systems of Linear Equations
- New Bounds for Restricted Isometry Constants
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
