Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery

DOI10.1109/TSP.2016.2568166MaRDI QIDQ4620895zbMATH OpenFDO

Authors Gongguo Tang, Arye Nehorai

Publication date 8 February 2019

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Semidefinite programming (90C22)

Recommendations

• Block-sparse recovery of semidefinite systems and generalized null space conditions
• Computable Performance Bounds on Sparse Recovery
• Block-Sparse Recovery via Convex Optimization
• Sparse Recovery Conditions and Performance Bounds for $\ell _p$-Minimization
• Block sparse recovery via mixed l₂/l₁ minimization
• Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
• Lower bounds for sparse recovery

Cited in

(3)

• Computable Performance Bounds on Sparse Recovery
• Block-sparse recovery of semidefinite systems and generalized null space conditions
• Sparsity-Based MIMO Radars

This page was built for publication: Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery

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