On Greedy Algorithms with bounded cumulative coherence
Numerical Analysis
2009-11-10 v1
Abstract
We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.
Keywords
Cite
@article{arxiv.0911.1500,
title = {On Greedy Algorithms with bounded cumulative coherence},
author = {Eugene Livshitz},
journal= {arXiv preprint arXiv:0911.1500},
year = {2009}
}