On the optimality of the Orthogonal Greedy Algorithm for μμ-coherent dictionaries

In this article, we continue to study the performance of Greedy Algorithms. We show that the Orthogonal Greedy Algorithm (Orthogonal Matching Pursuit) provides an almost optimal approximation on the first [μ−1/20][μ−1/20] steps for μμ-coherent dictionaries.