Sparse approximation and recovery by greedy algorithms

IEEE Transactions on Information Theory

Volumn 60, Issue 7, 2014, Pages 3989-4000

  Livshitz, Eugene D ^a,b   Temlyakov, Vladimir N ^c,d  

^a Evernote Corporation   (Russian Federation)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

^c UNIVERSITY OF SOUTH CAROLINA   (United States)

^d STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

Greedy algorithms; Lebesgue type inequality; orthogonal matching pursuit; probability; sparse approximation

Indexed keywords

BANACH SPACES; HILBERT SPACES; MATRIX ALGEBRA; PROBABILITY; RECOVERY; VECTOR SPACES;

EXACT RECOVERIES; GREEDY ALGORITHMS; HIGH PROBABILITY; HILBERT SPACE SETTING; LEBESGUE-TYPE INEQUALITY; ORTHOGONAL MATCHING PURSUIT; RESTRICTED ISOMETRY PROPERTIES; SPARSE APPROXIMATIONS;

APPROXIMATION ALGORITHMS;

EID: 84902970934     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2014.2320932     Document Type: Article

References (22)

1. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005 (Pubitemid 41800353)
2. T. T. Cai, L. Wang, and G. Xu, "Shifting inequality and recovery for sparse signals," IEEE Trans. Inf. Theory, vol. 57, no. 11, pp. 4689-4708, Nov. 2011
3. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing signal reconstruction," IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2230-2249, May 2009
4. D. Donoho, M. Elad, and V. N. Temlyakov, "On Lebesgue type inequalities for greedy approximation," J. Approx. Theory, vol. 147, no. 2, pp. 185-195, 2007
5. A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss, "Approximation of functions over redundant dictionaries using coherence," in Proc. 14th Annu. ACM-SIAM Symp. Discrete Algorithms, 2003
6. S. Foucart, "Sparse recovery algorithms: Sufficient conditions in terms of restricted isometry constants," Approx. Theory, vol. 13, pp. 65-77, Jun. 2012
7. E. D. Livshitz, "On the optimality of the orthogonal greedy algorithm for '-coherent dictionaries," J. Approx. Theory, vol. 164, no. 5, pp. 668-681, 2012
8. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol. 26, no. 3, pp. 301-321, 2009
9. D. Needell and R. Vershynin, "Uniform uncertainty principle and signal recovery via orthogonal matching pursuit," Found. Comput. Math., vol. 9, no. 3, pp. 317-334, 2009
10. D. Savu and V. N. Temlyakov, "Lebesgue-type inequalities for greedy approximation in Banach spaces," IEEE Trans. Inf. Theory, vol. 59, no. 2, pp. 1098-1106, Feb. 2013
11. V. N. Temlyakov, "Weak greedy algorithms," Adv. Comput. Math., vol. 12, no. 1, pp. 213-227, 2000
12. V. N. Temlyakov, "Greedy algorithms in Banach spaces," Adv. Comput. Math., vol. 14, no. 3, pp. 277-292, 2001
13. V. N. Temlyakov, "Nonlinear methods of approximation," Found. Comput. Math., vol. 3, no. 1, pp. 33-107, 2003
14. V. N. Temlyakov, "Foundations of computational mathematics," in Greedy Approximations (Mathematical Society Lecture Notes), vol. 331. Cambridge, U.K.: Cambridge Univ. Press, 2006, pp. 371-394
15. V. N. Temlyakov, Greedy Approximation. Cambridge, U.K.: Cambridge Univ. Press, 2011
16. V. N. Temlyakov, "Greedy approximation in convex optimization," ArXiv: 1206.0392v1, pp. 1-28, Jun. 2012
17. V. N. Temlyakov, "Greedy expansions in convex optimization," ArXiv:1206.0393v1, pp. 1-27, Jun. 2012
18. V. N. Temlyakov, "Sparse approximation and recovery by greedy algorithms in Banach spaces," ArXiv:1303.6811v1, pp. 1-27, Mar. 2013, ArXiv: 1303.6811v1
19. V. Temlyakov and P. Zheltov, "On performance of greedy algorithms," J. Approx. Theory, vol. 163, no. 9, pp. 1134-1145, 2011
20. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004
21. J. Wang and B. Shim, How Many Iterations are Needed for the Exact Recovery of Sparse Signals using Orthogonal Matching Pursuit?, ArXiv:1211.4293, Nov. 2012, pp. 1-9
22. T. Zhang, "Sparse recovery with orthogonal matching pursuit under RIP," IEEE Trans. Inf. Theory, vol. 57, no. 9, pp. 6215-6221, Sep. 2011.