On Greedy Algorithms with bounded cumulative coherence
Eugene Livshitz
所有作者
Eugene Livshitz
文献摘要
We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.