On Lebesgue-type inequalities for greedy approximation

Journal of Approximation Theory

Volumn 147, Issue 2, 2007, Pages 185-195

  Donoho, D L ^a   Elad, M ^b   Temlyakov, V N ^c  

^a STANFORD UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Coherence; Dictionary; Greedy algorithm; Lebesgue inequality

Indexed keywords

EID: 34447622649     PISSN: 00219045     EISSN: 10960430     Source Type: Journal    
DOI: 10.1016/j.jat.2007.01.004     Document Type: Article

References (8)

1. Donoho D.L., Elad M., and Temlyakov V.N. Stable recovery of sparse overcomplete representations in the presence of noise. IMI-Preprints 06 (2004) 1-42
2. DeVore R.A., and Temlyakov V.N. Some remarks on Greedy Algorithms. Adv. Comp. Math. 5 (1996) 173-187
3. A.C. Gilbert, S. Muthukrishnan, M.J. Strauss, Approximation of functions over redundant dictionaries using coherence, The 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.
4. Konyagin S.V., and Temlyakov V.N. Greedy approximation with regard to bases and general minimal systems. Serdica Math. J. 28 (2002) 305-328
5. Temlyakov V.N. Greedy Algorithms and m-term approximation with regard to redundant dictionaries. J. Approx. Theory 98 (1999) 117-145
6. Temlyakov V.N. Weak greedy algorithms. Adv. Comp. Math. 12 (2000) 213-227
7. Temlyakov V.N. Nonlinear methods of approximation. Found. Comput. Math. 3 (2003) 33-107
8. Tropp J.A. Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50 (2004) 2231-2242