On Theorem 10 in “On Polar Polytopes and the Recovery of Sparse Representations” [Sep 07 3188-3195]

DOI10.1109/TIT.2013.2259294MaRDI QIDQ5346445zbMATH OpenOpenAlexFDO

Authors Bob L. Sturm, Boris Mailhé, Mark D. Plumbley

Publication date 8 June 2017

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

Full work available at URL https://doi.org/10.1109/tit.2013.2259294

Mathematics Subject Classification ID

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

Recommendations

• On Polar Polytopes and the Recovery of Sparse Representations
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• The recovery guarantee for orthogonal matching pursuit method to reconstruct sparse polynomials
• A sparse quadratic \(T(1)\) theorem
• A note on the representation of positive polynomials with structured sparsity
• The sparsest solution of the union of finite polytopes via its nonconvex relaxation
• Some lower bounds on sparse outer approximations of polytopes
• An algebraic perspective on integer sparse recovery
• On Tensors, Sparsity, and Nonnegative Factorizations
• On the Performance of Sparse Recovery Via \ell_p-Minimization (0 \leq p \leq 1)

This page was built for publication: On Theorem 10 in “On Polar Polytopes and the Recovery of Sparse Representations” [Sep 07 3188-3195]

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