Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
From MaRDI portal
Publication:1688516
DOI10.1186/s13660-017-1590-xzbMath1387.94046OpenAlexW2779744796WikidataQ47106434 ScholiaQ47106434MaRDI QIDQ1688516
Publication date: 8 January 2018
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1590-x
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Cites Work
- A mathematical introduction to compressive sensing
- Recovery of sparsest signals via \(\ell^q \)-minimization
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- A note on the complexity of \(L _{p }\) 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\)
- Fast implementation of orthogonal greedy algorithm for tight wavelet frames
- A new bound on the block restricted isometry constant in compressed sensing
- Exact matrix completion via convex optimization
- $NP/CMP$ Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$ Minimization and $l_{p}$ Minimization for Information Processing
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Greed is Good: Algorithmic Results for Sparse Approximation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Iteratively reweighted least squares minimization for sparse recovery
- Sparse Approximate Solutions to Linear Systems
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- A sparse signal reconstruction perspective for source localization with sensor arrays
- Sparse nonnegative solution of underdetermined linear equations by linear programming
This page was built for publication: Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization