Computable Performance Bounds on Sparse Recovery

DOI10.1109/TSP.2014.2365766MaRDI QIDQ4579665zbMATH OpenOpenAlexFDO

Authors Gongguo Tang, Arye Nehorai

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2014.2365766

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Computational complexity versus statistical performance on sparse recovery problems
• Lower bounds for sparse recovery
• Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery
• Sparse Recovery Conditions and Performance Bounds for $\ell _p$-Minimization
• Approximate sparse recovery: optimizing time and measurements
• Approximate sparse recovery: optimizing time and measurements
• Sparse Approximation and Recovery by Greedy Algorithms
• Lower bounds for adaptive sparse recovery
• On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
• Performance Analysis for Sparse Support Recovery

Cited in

(7)

• Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
• Computing and analyzing recoverable supports for sparse reconstruction
• Average Performance of the Sparsest Approximation Using a General Dictionary
• Approximate sparse recovery: optimizing time and measurements
• Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery
• Performance Analysis of Sparse Recovery Based on Constrained Minimal Singular Values
• On the Fundamental Limits of Recovering Tree Sparse Vectors From Noisy Linear Measurements

This page was built for publication: Computable Performance Bounds on Sparse Recovery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579665)