Uniqueness Conditions for A Class of ℓ0-Minimization Problems
DOI10.1142/S0217595915400023zbMath1311.90041arXiv1312.4280MaRDI QIDQ5245836
Publication date: 15 April 2015
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.4280
uniqueness condition\(\ell_{0}\)-minimization\(l_{p}\)-induced quasi-normmaximal scaled coherence rankscaled mutual (sub)coherencescaled spark
Minimax problems in mathematical programming (90C47) Production models (90B30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Linear equations (linear algebraic aspects) (15A06)
Related Items (1)
Cites Work
- New and improved conditions for uniqueness of sparsest solutions of underdetermined linear systems
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- A non-adapted sparse approximation of PDEs with stochastic inputs
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- Applied mathematics meets signal processing.
- A short note on compressed sensing with partially known signal support
- Limits for the characteristic roots of a matrix
- Sparse and Redundant Representations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Uncertainty principles and ideal atomic decomposition
- Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- Sparse Approximate Solutions to Linear Systems
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
This page was built for publication: Uniqueness Conditions for A Class of ℓ0-Minimization Problems
