Sparse Recovery, Kashin Decomposition and Conic Programming

2011/01/15 by Alexandre d'Aspremont, Alexandre d’Aspremont, d'Aspremont, Alexandre · 1 citation
Engineering · Mathematics · #90C22 #90C27 #94A12 #FOS: Mathematics #Mathematical Approximation and Integration #Optimization and Control (math.OC) #Point processes and geometric inequalities #Sparse and Compressive Sensing Techniques #math.OC #msc:90C22 #msc:90C27 #msc:94A12

paper · pdf · doi:10.48550/arxiv.1101.3027

First, conference version

arxiv created 2011/01/15 · openalex publication_date 2011/01/15 · arxiv updated 2015/03/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We produce relaxation bounds on the diameter of arbitrary sections of the l1 ball in Rⁿ. We use these results to test conditions for sparse recovery.

Cited by

• Compressed Sensing Recoverability In Imaging Modalities

Related

• On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1)
• Deterministic guarantees for L¹-reconstruction: A large sieve approach with geometric flexibility
• Sparse polynomial interpolation: sparse recovery, super resolution, or Prony?
• On the tightness of an SDP relaxation of k-means
• Maximal sections of the unit ball of lⁿ_p(ℂ) for p > 2