Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise
DOI10.1109/TIT.2008.2009812zbMATH Open1367.94105OpenAlexW2099167393MaRDI QIDQ4975744FDOQ4975744
Authors: Paul Tseng 
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.2009812
Numerical optimization and variational techniques (65K10) Inference from stochastic processes and prediction (62M20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Signal detection and filtering (aspects of stochastic processes) (60G35)
Cited In (6)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Signal recovery under cumulative coherence
- Improved stability conditions of BOGA for noisy block-sparse signals
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
- Signal recovery under mutual incoherence property and oracle inequalities
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
This page was built for publication: Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975744)
