The Gelfand widths of lp-balls for 0

Authors:
Simon Foucart;Alain Pajor;Holger Rauhut;Tino Ullrich
Affiliations:
Université Pierre et Marie Curie, Laboratoire Jacques-Louis Lions, 175, rue du Chevaleret, 75013 Paris, France;Université de Paris Est Marne-la-Vallée, íquipe d'Analyse et de Mathématiques Appliquées 5, Boulevard Descartes, Champs sur Marne, 77454 Marne-la-Vallée Cedex 2, Fran ...;Hausdorff Center for Mathematics & Institute for Numerical Simulation, University of Bonn, Endenicher Allee 60, 53115 Bonn, Germany;Hausdorff Center for Mathematics & Institute for Numerical Simulation, University of Bonn, Endenicher Allee 60, 53115 Bonn, Germany
Venue:
Journal of Complexity
Year:
2010

Optimal recovery and n-widths for convex classes of functions

Journal of Approximation Theory
Hardness vs randomness

Journal of Computer and System Sciences
Atomic Decomposition by Basis Pursuit

SIAM Journal on Scientific Computing
Are bitvectors optimal?

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A lower estimate for entropy numbers

Journal of Approximation Theory
Convex Optimization

Convex Optimization
The Geometry of Random {-1,1}-Polytopes

Discrete & Computational Geometry
How Neighborly Can a Centrally Symmetric Polytope Be?

Discrete & Computational Geometry
Widths of embeddings in function spaces

Journal of Complexity
Lower bounds for sparse recovery

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lower bounds for constant weight codes

IEEE Transactions on Information Theory
Sparse representations in unions of bases

IEEE Transactions on Information Theory
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

IEEE Transactions on Information Theory
Compressed sensing

IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

IEEE Transactions on Information Theory

Sparse representations and approximation theory

Journal of Approximation Theory
Sparse recovery with partial support knowledge

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Gelfand and Kolmogorov numbers of Sobolev embeddings of weighted function spaces

Journal of Complexity
Sparse Legendre expansions via l1-minimization

Journal of Approximation Theory
Full length article: Nonuniform support recovery from noisy random measurements by Orthogonal Matching Pursuit

Journal of Approximation Theory
Full length article: Widths of embeddings in weighted function spaces

Journal of Approximation Theory
On model-based RIP-1 matrices

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Full length article: Widths of embeddings of 2-microlocal Besov spaces

Journal of Approximation Theory

Hi-index	0.00

We provide sharp lower and upper bounds for the Gelfand widths of @?"p-balls in the N-dimensional @?"q^N-space for 0