Sparse Recovery, Kashin Decomposition and Conic Programming
classification
🧮 math.OC
keywords
recoverysparsearbitraryballboundsconditionsconicdecomposition
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.