On performance of greedy algorithms

Journal of Approximation Theory

Volumn 163, Issue 9, 2011, Pages 1134-1145

  Temlyakov, Vladimir N ^a   Zheltov, Pavel ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Additive type Lebesgue inequality; Coherence; Greedy algorithm; Incoherent dictionary; M term approximation; Orthogonal greedy algorithm; Orthogonal matching pursuit; Sparse representation

Indexed keywords

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

References (18)

1. Davis G., Mallat S., Avellaneda M. Adaptive greedy approximations. Constr. Approx. 1997, 13(1):57-98. 10.1007/s003659900033.
2. DeVore R.A., Temlyakov V.N. Some remarks on greedy algorithms. Adv. Comput. Math. 1996, 5(2-3):173-187. 10.1007/BF02124742.
3. Donoho D.L., Elad M. Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization. Proc. Natl. Acad. Sci. USA 2003, 100(5):2197-2202. (electronic) doi:10.1073/pnas.0437847100.
4. Donoho D.L., Elad M., Temlyakov V.N. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory 2006, 52(1):6-18. 10.1109/TIT.2005.860430.
5. Donoho D.L., Elad M., Temlyakov V.N. On Lebesgue-type inequalities for greedy approximation. J. Approx. Theory 2007, 147:185-195.
6. D.L. Donoho, Y. Tsaig, I. Drori, J. Luc Starck, Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit, Tech. Rep., 2006.
7. Gilbert A.C., Muthukrishnan S., Strauss M.J. Approximation of functions over redundant dictionaries using coherence. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2003, 243-252. ACM, New York.
8. Gribonval R., Nielsen M. Sparse representations in unions of bases. IEEE Trans. Inform. Theory 2003, 49(12):3320-3325. 10.1109/TIT.2003.820031.
9. Huber P.J. Projection pursuit. Ann. Statist. 1985, 13(2):435-525. 10.1214/aos/1176349519.
10. Jones L.K. On a conjecture of Huber concerning the convergence of projection pursuit regression. Ann. Statist. 1987, 15(2):880-882.
11. Livshitz E.D., Temlyakov V.N. Two lower estimates in greedy approximation. Constr. Approx. 2003, 19(4):509-523. 10.1007/s00365-003-0533-6.
12. Needell D., Tropp J.A. CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 2009, 26(3):301-321. 10.1016/j.acha.2008.07.002.
13. Needell D., Vershynin R. Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Found. Comput. Math. 2009, 9(3):317-334. 10.1007/s10208-008-9031-3.
14. Y.C. Pati, R. Rezaiifar, P.S. Krishnaprasad, Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition, in: Proc. 27th Annu. Asilomar Conf. Signals, Systems and Computers, 1993.
15. Temlyakov V.N. Greedy approximation. Acta Numer. 2008, 17:235-409. 10.1017/S0962492906380014.
16. Tropp J.A. Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 2004, 50(10):2231-2242. 10.1109/TIT.2004.834793.
17. Tropp J.A., Gilbert A.C. Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inform. Theory 2007, 53(12):4655-4666. 10.1109/TIT.2007.909108.
18. P. Zheltov, Lebesgue-type inequalities for greedy approximation, Ph.D. Thesis, USC, 2010.