Stability analysis of a class of sparse optimization problems

DOI10.1080/10556788.2020.1734003zbMath1454.90026arXiv1904.09637OpenAlexW3010010466MaRDI QIDQ5135257

Jialiang Xu, Yun-bin Zhao

Publication date: 19 November 2020

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

stabilityoptimality condition\(\ell_1\)-minimizationsparsity optimizationHoffman theoremrestricted weak range space property

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Inverse problems in linear algebra (15A29)

Related Items (3)

Stability of 1-bit compressed sensing in sparse data reconstruction ⋮ Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems ⋮ Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems

Uses Software

• PDCO

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
• 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}\)
• Bounds for error in the solution set of a perturbed linear program
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Metric entropy of some classes of sets with differentiable boundaries
• 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
• Compressed sensing and best 𝑘-term approximation
• Decoding by Linear Programming
• Atomic Decomposition by Basis Pursuit
• Uncertainty principles and ideal atomic decomposition
• Sparse Optimization Theory and Methods
• Performance Analysis of Sparse Recovery Based on Constrained Minimal Singular Values
• RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
• Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction
• New Bounds for Restricted Isometry Constants
• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: Stability analysis of a class of sparse optimization problems