arXiv Open Access 2011

Sparse Recovery, Kashin Decomposition and Conic Programming

Alexandre d'Aspremont
Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

Penulis (1)

A

Alexandre d'Aspremont

Format Sitasi

d'Aspremont, A. (2011). Sparse Recovery, Kashin Decomposition and Conic Programming. https://arxiv.org/abs/1101.3027

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2011
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓