On Polar Polytopes and the Recovery of Sparse Representations

DOI10.1109/TIT.2007.903129zbMath1325.94038arXivcs/0510032MaRDI QIDQ3548904

Mark D. Plumbley

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0510032

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Pattern recognition, speech recognition (68T10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

Computing and analyzing recoverable supports for sparse reconstruction ⋮ Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT ⋮ Optimization Methods for Synthetic Aperture Radar Imaging ⋮ 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory ⋮ Optimal dual certificates for noise robustness bounds in compressive sensing ⋮ DASSO: Connections Between the Dantzig Selector and Lasso ⋮ Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction