Performance analysis of sparse recovery based on constrained minimal singular values

IEEE Transactions on Signal Processing

Volumn 59, Issue 12, 2011, Pages 5734-5745

  Tang, Gongguo ^a   Nehorai, Arye ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASIS PURSUITS; DANTZIG SELECTOR; EFFICIENT ALGORITHM; HIGH PROBABILITY; INTERIOR POINT ALGORITHM; LOWER BOUNDS; MEASUREMENT MATRIX; MEASUREMENT NOISE; ORDERS OF MAGNITUDE; PERFORMANCE ANALYSIS; RECOVERY PERFORMANCE; SEMIDEFINITE RELAXATION; SINGULAR VALUES; SPARSE RECOVERY; SPARSE SIGNAL RECONSTRUCTION; SPARSE SIGNALS; SUB-GAUSSIANS; SUFFICIENT CONDITIONS;

RECOVERY; SIGNAL RECONSTRUCTION;

ALGORITHMS;

EID: 81455148129     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2011.2164913     Document Type: Article

References (45)

1. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006. (Pubitemid 43174093)
2. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
3. 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)
4. E. G. Larsson and Y. Selen, "Linear regression with a sparse parameter vector," IEEE Trans. Signal Process., vol. 55, no. 2, pp. 451-460, Feb. 2007. (Pubitemid 46351271)
5. D. Malioutov, M. Cetin, and A. S. Willsky, "A sparse signal reconstruction perspective for source localization with sensor arrays," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 3010-3022, Aug. 2005. (Pubitemid 41372811)
6. D. Model and M. Zibulevsky, "Signal reconstruction in sensor arrays using sparse representations," Signal Process., vol. 86, pp. 624-638, Mar. 2006. (Pubitemid 43106575)
7. D. L. Donoho and P. B. Stark, "Uncertainty principles and signal recovery," SIAM J. Appl. Math., vol. 49, no. 3, pp. 906-931, 1989.
8. F. Parvaresh, H. Vikalo, S. Misra, and B. Hassibi, "Recovering sparse signals using sparse measurement matrices in compressed DNA microarrays," IEEE J. Sel. Topics Signal Process., vol. 2, no. 3, pp. 275-285, Jun. 2008.
9. M. A. Herman and T. Strohmer, "High-resolution radar via compressed sensing," IEEE Trans. Signal Process., vol. 57, no. 6, pp. 2275-2284, Jun. 2009.
10. Z. Tian and G. B. Giannakis "Compressed sensing for wideband cognitive radios," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP 2007), Honolulu, HI, Apr. 2007, pp. IV-1357-IV-1360. (Pubitemid 47178630)
11. S. Sen, G. Tang, and A. Nehorai, "Multiobjective optimization of OFDM radar waveform for target detection," IEEE Trans. Signal Process., vol. 59, no. 2, pp. 639-652, Feb. 2011.
12. E. J. Candès "The restricted isometry property and its implications for compressed sensing," in Compte Rendus de l'Acad. Sci., Paris, Serie I, 2008, vol. 346, pp. 589-592.
13. A. Cohen, W. Dahmen, and R. DeVore, "Compressed sensing and best term approximation," J. Amer. Math. Soc., vol. 22, pp. 211-231, Jul. 2009.
14. D. L. Donoho and J. Tanner "Neighborliness of randomly projected simplices in high dimensions," in Proc. Nat. Acad. Sci. USA, 2005, vol. 102, no. 27, pp. 9452-9457.
15. R. DeVore, R. Baraniuk, M. Davenport, and M. B. Wakin, "A simple proof of the restricted isometry property for random matrices," Construct. Approx., vol. 28, no. 3, pp. 253-263, 2008.
16. M. Rudelson and R. Vershynin, "On sparse reconstruction from Fourier and Gaussian measurements," Commun. Pure and Appl. Math., vol. 61, pp. 1025-1045, 2008.
17. M. Stojnic, W. Xu, and B. Hassibi, "Compressed sensing-probabilistic analysis of a null-space characterization," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP 2008), Las Vegas, NV, Mar. 2008, pp. 3377-3380.
18. A. d'Aspremont, L. El Ghaoui, M. Jordan, and G. R. G. Lanckriet, "A direct formulation for sparse PCA using semidefinite programming," SIAM Rev., vol. 49, no. 3, pp. 434-448, 2007. (Pubitemid 47377693)
19. A. d'Aspremont and L. El Ghaoui, "Testing the nullspace property using semidefinite programming," Math. Program., vol. 127, no. 1, pp. 123-144, 2011.
20. A. Juditsky and A. Nemirovski, "On verifiable sufficient conditions for sparse signal recovery via minimization," Math. Program., vol. 127, no. 1, pp. 57-88, 2011.
21. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comp., vol. 20, no. 1, pp. 33-61, 1998. (Pubitemid 128689501)
22. E. J. Candès and T. Tao, "The Dantzig selector: Statistical estimation when is much larger than," Ann. Statist., vol. 35, pp. 2313-2351, 2007.
23. R. Tibshirani "Regression shrinkage and selection via LASSO," J. Roy. Statist. Soc. Ser. B, vol. 58, pp. 267-288.
24. Y. Zhang, A Simple Proof for Recoverability of -Minimization: Go Over or Under? Rice CAAM Dep. , 2005, Tech. Rep..
25. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2845-2862, Nov. 2001. (Pubitemid 33053488)
26. D. Donoho, High-Dimensional Centrally-Symmetric Polytopes With Neighborliness Proportional to Dimension Dep. Statist., Stanford Univ., Stanford, CA, 2004.
27. P. Bickel, Y. Ritov, and A. Tsybakov, "Simultaneous analysis of Lasso and Dantzig selector," Ann. Statist., vol. 37, no. 4, pp. 1705-1732, 2009.
28. P. J. Bickel, "Discussion of the Dantzig selector: Statistical estimation when is much larger than by E. J. Candès and T. Tao," Ann. Stat., vol. 35, pp. 2352-2357, 2007.
29. V. Kekatos and G. B. Giannakis, Sparse Volterra and Polynomial Regression Models: Recoverability and Estimation Arxiv preprint arXiv:1103.0769, 2011.
30. S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, "Reconstruction and sub-Gaussian operators in asymptotic geometric analysis," Geometr. Funct. Analysis., pp. 1248-1282, Nov. 2007.
31. H. Rauhut, "Compressive sensing and structured random matrices," Theoret. Found. Numer. Methods for Sparse Recov., vol. 9, pp. 1-92, 2010.
32. G. Tang, "The -CMSV for bounded orthonormal systems," Dept. Elect. Syst. Eng.,Washington Univ., St. Louis, MO, Tech. Note, 2011.
33. H. Bodlaender, P. Gritzmann, V. Klee, and J. Leeuwen, "Computational complexity of norm-maximization," Combinatorica, vol. 10, pp. 203-225, 1990.
34. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
35. E. Andersen and K. Andersen, The MOSEK Optimization Tools Mannual, Version 5.0 [Online]. Available: http://www.mosek.com
36. A. Sofer and S. G. Nash, Linear and Nonlinear Programming. New York: McGraw-Hill, 1996.
37. R. H. Byrd, J. C. Gilbert, and J. Nocedal, "A trust region method based on interior point techniques for nonlinear programming," Math. Program., vol. 89, no. 1, pp. 149-185, 2000.
38. R. H. Byrd, M. E. Hribar, and J. Nocedal, "An interior point algorithm for large-scale nonlinear programming," SIAM J. Optimiz., vol. 9, no. 4, pp. 877-900, 1999. (Pubitemid 129489310)
39. R. A. Waltz, J. L. Morales, J. Nocedal, and D. Orban, "An interior algorithm for nonlinear optimization that combines line search and trust region steps," Math. Program., vol. 107, no. 3, pp. 391-408, 2006.
40. L. Lovász and A. Schrijver, "Cones of matrices and set-functions and 0-1 optimization," SIAM J. Optimiz., vol. 1, pp. 166-190, 1991.
41. F. Alizadeh, "Interior point methods in semidefinite programming with applications to combinatorial optimization," SIAM J. Optimiz., vol. 5, pp. 13-51, 1995.
42. J. Sturm, "Using SEDUMI 1.0 aMATLAB toolbox for optimization over symmetric cones," Optimiz. Methods and Software, vol. 11, pp. 625-653, 1999.
43. R. H. Tutuncu, K. C. Toh, and M. J. Todd, "Solving semidefinite- quadratic-linear programs using SDPT3," Math. Program. Ser. B, vol. 95, pp. 189-217, 2003. (Pubitemid 44757853)
44. M. Grant and S. Boyd, CVX: Matlab Software for Disciplined Convex Programming (Web Page and Software). Jun. 2009.
45. E. J. Candès and Y. Plan, "Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2342-2359, Apr. 2011.