English

Sparse Recovery, Kashin Decomposition and Conic Programming

Optimization and Control 2015-03-17 v1

Abstract

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

Cite

@article{arxiv.1101.3027,
  title  = {Sparse Recovery, Kashin Decomposition and Conic Programming},
  author = {Alexandre d'Aspremont},
  journal= {arXiv preprint arXiv:1101.3027},
  year   = {2015}
}

Comments

First, conference version

R2 v1 2026-06-21T17:12:39.560Z