Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013, Article ID 636094, 6 pages
http://dx.doi.org/10.1155/2013/636094
Research Article

Recovery of High-Dimensional Sparse Signals via -Minimization

College of Mathematics and Information Sciences, North China University of Water Resources and Electric Power, Zhengzhou 450011, China

Received 4 June 2013; Accepted 15 July 2013

Academic Editor: Sabri Arik

Copyright © 2013 Shiqing Wang and Limin Su. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Q. Wang and L. M. Su, “The oracle inequalities on simultaneous Lasso and Dantzig selector in high-dimensional nonparametric regression,” Mathematical Problems in Engineering, vol. 2013, Article ID 571361, 6 pages, 2013. View at Publisher · View at Google Scholar
  2. P. J. Bickel, Y. Ritov, and A. B. Tsybakov, “Simultaneous analysis of lasso and Dantzig selector,” The Annals of Statistics, vol. 37, no. 4, pp. 1705–1732, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. E. J. Candès, “The restricted isometry property and its implications for compressed sensing,” Comptes Rendus Mathématique, vol. 346, no. 9-10, pp. 589–592, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. E. Candes and T. Tao, “The Dantzig selector: statistical estimation when p is much larger than n,” The Annals of Statistics, vol. 35, no. 6, pp. 2313–2351, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  5. E. Candes, “Compressive sampling,” in Proceedings of the International Congress of Mathematicians, pp. 1433–1452, Madrid, Spain, August 2006.
  6. E. J. Candes and T. Tao, “Near-optimal signal recovery from random projections: universal encoding strategies?” IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5406–5425, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  7. E. J. Candès, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on Pure and Applied Mathematics, vol. 59, no. 8, pp. 1207–1223, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. J. A. Tropp, “Just relax: convex programming methods for identifying sparse signals in noise,” IEEE Transactions on Information Theory, vol. 52, no. 3, pp. 1030–1051, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  9. E. J. Candes and T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203–4215, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. J. J. Fuchs, “Recovery of exact sparse representations in the presence of bounded noise,” IEEE Transactions on Information Theory, vol. 51, no. 10, pp. 3601–3608, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  11. J.-J. Fuchs, “On sparse representations in arbitrary redundant bases,” IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1341–1344, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  12. A. Nemirovski, “Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems,” SIAM Journal on Optimization, vol. 15, no. 1, pp. 229–251, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society B, vol. 58, no. 1, pp. 267–288, 1996. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. D. L. Donoho and X. Huo, “Uncertainty principles and ideal atomic decomposition,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2845–2862, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. D. L. Donoho, M. Elad, and V. N. Temlyakov, “Stable recovery of sparse overcomplete representations in the presence of noise,” IEEE Transactions on Information Theory, vol. 52, no. 1, pp. 6–18, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  16. R. Gribonval and M. Nielsen, “Sparse representations in unions of bases,” IEEE Transactions on Information Theory, vol. 49, no. 12, pp. 3320–3325, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  17. T. T. Cai, G. Xu, and J. Zhang, “On recovery of sparse signals via 1 minimization,” IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3388–3397, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  18. P. Tseng, “Further results on stable recovery of sparse overcomplete representations in the presence of noise,” IEEE Transactions on Information Theory, vol. 55, no. 2, pp. 888–899, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  19. T. T. Cai, L. Wang, and G. Xu, “Stable recovery of sparse signals and an oracle inequality,” IEEE Transactions on Information Theory, vol. 56, no. 7, pp. 3516–3522, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  20. T. T. Cai, L. Wang, and G. Xu, “Shifting inequality and recovery of sparse signals,” IEEE Transactions on Signal Processing, vol. 58, no. 3, pp. 1300–1308, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  21. D. L. Donoho, “For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution,” Communications on Pure and Applied Mathematics, vol. 59, no. 6, pp. 797–829, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  22. T. T. Cai, L. Wang, and G. Xu, “New bounds for restricted isometry constants,” IEEE Transactions on Information Theory, vol. 56, no. 9, pp. 4388–4394, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  23. J. A. Tropp, “Greed is good: algorithmic results for sparse approximation,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2231–2242, 2004. View at Publisher · View at Google Scholar · View at MathSciNet