Constructing test instances for basis pursuit denoising

IEEE Transactions on Signal Processing

Volumn 61, Issue 5, 2013, Pages 1210-1214

  Lorenz, Dirk A ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Basis Pursuit denoising; compressed sensing; optimization; optimization algorithms; signal processing algorithms; sparsity

Indexed keywords

BASIS PURSUIT DENOISING; OPTIMIZATION ALGORITHMS; SIGNAL PROCESSING ALGORITHMS; SPARSITY; TEST INSTANCES;

COMPRESSED SENSING; OPTIMIZATION; SIGNAL PROCESSING;

ALGORITHMS;

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

References (34)

1. E. van den Berg and M. P. Friedlander, "Probing the Pareto frontier for basis pursuit solutions," SIAM J. Sci. Comput., vol. 31, no. 2, pp. 890-912, 2008.
2. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1998.
3. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Roy. Statist. Soc. B, vol. 58, no. 1, pp. 267-288, 1996.
4. I. Loris, "On the performance of algorithms for the minimization of-penalized functionals," Inverse Problems, vol. 25, 2009, 035008, 16 pp.
5. E. van den Berg and M. P. Friedlander, "Theoretical and empirical results for recovery from multiple measurements," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2516-2527, 2010.
6. M. Mishali and Y. C. Eldar, "Reduce and boost: Recovering arbitrary sets of jointly sparse vectors," IEEE Trans. Signal Process., vol. 56, no. 10, pt. 1, pp. 4692-4702, 2008.
7. B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization," SIAM Rev., vol. 52, no. 3, pp. 471-501, 2010.
8. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
9. M. Grasmair, M. Haltmeier, and O. Scherzer, "Sparse regularization with penalty term," Inverse Problems, vol. 24, no. 5, 2008, 055020, 13 pp.
10. D. A. Lorenz, S. Schiffler, and D. Trede, "Beyond convergence rates: Exact inversion with Tikhonov regularization with sparsity constraints," Inverse Problems, vol. 27, p. 085009, 2011.
11. M. Grasmair, O. Scherzer, and M. Haltmeier, "Necessary and sufficient conditions for linear convergence of-regularization," Commun. Pure Appl. Math., vol. 64, pp. 161-182, 2011.
12. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, 2005.
13. D. A. Lorenz, M. E. Pfetsch, and A. M. Tillmann, "Solving basis pursuit: Subgradient algorithm, heuristic optimality check, and solver comparison," Optim. Online, 2011, E-Print ID 2011-07-3100.
14. M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, "Gradient projection for sparse reconstruction: Applications to compressed sensing and other inverse problems," IEEE J. Sel. Topics Signal Process. vol. 4, pp. 586-597, 2007 [Online]. Available: http://www.ece.wisc.edu/%7Enowak/GPSR.pdf
15. M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, "Sparse reconstruction by separable approximation," IEEE Trans. Signal Process., vol. 57, no. 7, pp. 2479-2493, 2009.
16. S. Becker, J. Bobin, and E. J. Candès, "NESTA: A fast and accurate first-order method for sparse recovery," SIAM J. Imag. Sci., vol. 4, no. 1, pp. 1-39, 2009.
17. A. M. Bruckstein, D. L. Donoho, and M. Elad, "From sparse solutions of systems of equations to sparse modeling of signals and images," SIAM Rev., vol. 51, no. 1, pp. 34-81, 2009.
18. J. A. Tropp, "Just relax: Convex programming methods for identifying sparse signals in noise," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1030-1051, Mar. 2006.
19. S. R. Becker, private communication, 2011.
20. S. R. Becker, E. J. Candès, and M. C. Grant, "Templates for convex cone problems with applications to sparse signal recovery," Math. Programm. Comput. vol. 3, no. 3, pp. 165-218, 2011 [Online]. Available: http://dx.doi.org/10.1007/s12532-011-0029-5
21. S. R. Becker, "Practical compressed sensing: modern data acquisition and signal processing," Ph.D. dissertation, California Inst. of Technol., Pasadena, CA, USA, 2011.
22. E. T. Hale, W. Yin, and Y. Zhang, "Fixed-point continuation for minimization: Methodology and convergence," SIAM J. Optim., vol. 19, no. 3, pp. 1107-1130, 2008.
23. W. Yin, S. J. Osher, D. Goldfarb, and J. Darbon, "Bregman iterative algorithms for minimization with applications to compressed sensing," SIAM J. Imag. Sci., vol. 1, no. 1, pp. 143-168, 2008.
24. A. Beck and M. Teboulle, "Fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Imag. Sci., vol. 2, pp. 183-202, 2009.
25. R. Griesse and D. A. Lorenz, "A semismooth Newton method for Tikhonov functionals with sparsity constraints," Inverse Problems, vol. 24, no. 3, 2008, 035007, 19 pp.
26. J. Yang and Y. Zhang, "Alternating direction algorithms for O problems in compressive sensing," SIAM J. Sci. Comput., vol. 33, no. 1, pp. 250-278, 2011.
27. H. Lee, A. Battle, R. Raina, and A. Y. Ng, "Efficient sparse coding algorithms," in Proc. Neural Inf. Process. Syst. (NIPS), 2007, vol. 19, pp. 801-808.
28. I. Loris, "L1packv2: A Mathematica package for minimizing an P-penalized functional," Comput. Phys. Commun. vol. 179, pp. 895-902, 2008 [Online]. Available: http://arxiv.org/abs/0710.3728
29. H. H. Bauschke and J. M. Borwein, "On projection algorithms for solving convex feasibility problems," SIAM Rev., vol. 38, no. 3, pp. 367-426, 1996.
30. W. Cheney and A. A. Goldstein, "Proximity maps for convex sets," Proc. Amer. Math. Soc, vol. 10, pp. 448-450, 1959.
31. L. G. Gurin, B. T. Poljak, and È. V. Raik, "Projection methods for finding a common point of convex sets," Akad. Nauk SSSR. Žurnal Vyäslitel' nolMatematiki i Matematičeskoi Fiziki, vol. 7, pp. 1211-1228, 1967.
32. A. A. Goldstein, "On steepest descent," SIAM J. Control Optim., vol. 3, pp. 147-151, 1965.
33. M. Frank and P. Wolfe, "An algorithm for quadratic programming," Nav. Res. Logist. Quart., vol. 3, pp. 95-110, 1956.
34. A. Beck and M. Teboulle, "A conditional gradient method with linear rate of convergence for solving convex linear systems, "Math. Methods Oper. Res., vol. 59, pp. 235-247, 2004.