A theoretical result of sparse signal recovery via alternating projection method
From MaRDI portal
Publication:2656767
DOI10.1016/j.ins.2019.08.001zbMath1456.94015OpenAlexW2965762313MaRDI QIDQ2656767
Zhipeng Lin, Hai-Feng Liu, Ji-Gen Peng
Publication date: 16 March 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2019.08.001
Related Items (1)
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A mathematical introduction to compressive sensing
- Iterative hard thresholding for compressed sensing
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
- Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm
- $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
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Sparse and Redundant Representations
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Recovery of Sparse Signals Using Multiple Orthogonal Least Squares
- Sparse Approximate Solutions to Linear Systems
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Compressed sensing
- Matrix inequalities
This page was built for publication: A theoretical result of sparse signal recovery via alternating projection method
