Sparse approximation and recovery by greedy algorithms

Eugene Livshitz, Vladimir Temlyakov

We study sparse approximation by greedy algorithms. Our contribution is two-fold. First, we prove exact recovery with high probability of random $K$-sparse signals within $\lceil K…