Distributed basis pursuit

IEEE Transactions on Signal Processing

Volumn 60, Issue 4, 2012, Pages 1942-1956

  Mota, Joo F C ^a,b   Xavier, Joo M F ^a   Aguiar, Pedro M Q ^a   Puschel, Markus ^c  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c ETH ZURICH   (Switzerland)

Author keywords

Augmented Lagrangian; basis pursuit (BP); distributed optimization; sensor networks

Indexed keywords

ALTERNATING DIRECTION METHODS; AUGMENTED LAGRANGIANS; BASIS PURSUITS; COMPRESSED SENSING; DISTRIBUTED OPTIMIZATION; DISTRIBUTED PLATFORMS; OPTIMIZATION PROBLEMS; PROCESSING NODES; SHOW THROUGH; STATE-OF-THE-ART ALGORITHMS;

LINEAR SYSTEMS; OPTIMIZATION; SENSOR NETWORKS; SENSOR NODES;

ALGORITHMS;

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

References (65)

1. S. Chen, D. Donoho, and M. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1998.
2. A. Bruckstein, D. 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.
3. E. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, 2005.
4. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
5. E. 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, 2006.
6. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
7. J. Tropp, "Just relax: Convex programming methods for identifying sparse signals," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 1030-1051, 2006.
8. E. Candès and M.Wakin, "An introduction to compressive sampling," IEEE Signal Process. Mag., vol. 25, no. 2, 2008.
9. I. Akyildiz, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: A survey," Comput. Netw., vol. 38, pp. 393-422, 2002.
10. B. Krishnamachari, Networking Wireless Sensors. Cambridge, U.K.: Cambridge Univ. Press, 2005.
11. J. Tropp, J. Laska, M. Duarte, J. Romberg, and R. Baraniuk, "Beyond Nyquist: Efficient sampling of sparse bandlimited signals," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 520-544, 2010.
12. E. Candès and T. Tao, "Near-optimal signal recovery fromrandom projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, 2006.
13. J. Meng, L. Husheng, and Z. Han, "Sparse event detection in wireless sensor networks using compressive sensing," in Proc. 43rd Ann. Conf. Inf. Sci. Syst. (CISS), 2009.
14. V. Cevher, M. Duarte, and R. Baraniuk, "Distributed target localization via spatial sparsity," in Proc. 16th Eur. Signal Process. Conf. (EUSIPCO), 2008.
15. J. Romberg, R. Neelamani, C. Krohn, J. Krebs, M. Deffenbaugh, and J. Anderson, "Efficient seismic forward modeling using simultaneous random sources and sparsity," in Proc. Soc. Expl. Geophys. Ann. Meeting, 2008.
16. D. Bertsimas and J. Tsitsiklis, Introduction to Linear Optimization. New York: Athena Scientific, 1997.
17. C. Stunkel and D. Reed, "Hypercube implementation of the simplex algorithm," in Proc. 3rd Conf. Hypercube on Concurrent Comput. Appl., 1989, vol. 2, pp. 1473-1482.
18. H. Dutta and H. Kargupta, "Distributed linear programming and resource management for data mining in distributed environments," in Proc. IEEE Int. Conf. Data Mining Workshops, 2008, pp. 543-552.
19. I. Lobel, A. Ozdaglar, and D. Feijer, Distributed Multi-Agent OptimizationWith State-Dependent Communication Tech. Rep. LIDS Rep. 2834, 2010.
20. D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. New York: Athena Scientific, 1997.
21. A. Ruszczynski, "Augmented Lagrangian decomposition for sparse convex optimization," Int. Inst. Appl. Syst. Anal., 1992.
22. J. Mota, J. Xavier, P. Aguiar, and M. Püschel, "Distributed algorithms for basis pursuit," in Proc. 2nd Int. Workshop Signal Process. Adapt. Sparse Structured Represent., Saint-Malo, France, 2009.
23. J. Mota, J. Xavier, P. Aguiar, and M. Püschel, "Basis pursuit in sensor networks," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP), 2011.
24. E. Berg and M. Friedlander, "Probing the pareto frontier for basis pursuit solutions," SIAM J. Sci. Comput., vol. 31, no. 2, pp. 890-912, 2008.
25. Z. Wen, W. Yin, and Y. Zhang, "A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation," SIAM J. Sci. Comput., vol. 32, no. 4, pp. 1832-1857, 2010.
26. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, "Least angle regression," Ann. Statist., vol. 32, no. 2, pp. 407-499, 2004.
27. M. Afonso, J. Bioucas-Dias, and M. Figueiredo, "An augmented Lagrangian approach to the constrained optimization formulation of imaging inverse problems," IEEE Trans. Image Process., vol. 20, no. 3, pp. 681-695, 2011.
28. S. Becker, J. Bobin, and E. Candès, NESTA: A Fast and Accurate First-order Method for Sparse Recovery Calif. Inst. Technol., Pasadena, Tech. Rep., 2009.
29. J. Bazerque and G. Giannakis, "Distributed spectrum sensing for cognitive radio networks by exploiting sparsity," IEEE Trans. Signal Process., vol. 58, no. 3, pp. 1847-1862, 2010.
30. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, "Distributed optimization and statistical learning via the alternating method of multipliers," Found. Trends in Mach. Learn., vol. 3, no. 1, pp. 1-122, 2011.
31. S. Ram, A. Nedic, and V. Veeravalli, "A new class of distributed optimization algorithms: Application to regression of distributed data," Optimiz. Methods Software, pp. 1029-4937, 2010.
32. M. Garey and D. Johnson, Computers and Intractability. NewYork: W. H. Freeman, 1979.
33. F. Kuhn and R. Wattenhofer, "On the complexity of distributed graph coloring," in Proc. 25th Ann. ACM Symp. Principles of Distrib. Comput. (PODC'06 ), 2006.
34. D. Leith and P. Clifford, "Convergence of distributed learning algorithms for optimal wireless channel allocation," in Proc. IEEE Int. Conf. Decision Contr. (CDC), 2006, pp. 2980-2985.
35. K. Duffy, N. Connell, and A. Sapozhnikov, "Complexity analysis of a decentralized graph coloring algorithm," in Proc. Inf. Process. Lett., 2008.
36. N. Linial, "Locality in distributed graph algorithms," SIAM J. Comput., vol. 21, no. 1, pp. 193-201, 1992.
37. J. Mota, "Distributed Algorithms for Sparse Approximation" M.S. Thesis, IST, , Portugal, 2008 [Online]. Available: http://users.isr.ist. utl.pt/~jmota/publications.html
38. M. Friedlander, Exact Regularization of Linear Programs Univ. British Columbia, Tech. Rep., 2006.
39. O. Mangasarian and R. Meyer, "Nonlinear perturbation of linear programs," SIAM J. Contr. Optimiz., vol. 17, no. 6, pp. 745-752, 1979.
40. D. Bertsekas, Nonlinear Programming, 2nd ed. New York: Athena Scientific, 1999.
41. M. Raydan, "The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem," SIAM J. Optimiz., vol. 7, no. 1, pp. 26-33, 1997.
42. A. Nedic and A. Ozdaglar, "Distributed subgradientmethods formultiagent optimization," IEEE Trans. Autom. Contr., vol. 54, no. 1, 2009.
43. M. DeGroot, "Reaching a consensus," J. Amer. Statist. Assoc., vol. 69, no. 345, pp. 118-121, 1974.
44. I. Konnov, Equilibrium Models and Variational Inequalities. New York: Elsevier, 2007, vol. 210.
45. Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course. New York: Kluwer Academic, 2003.
46. P. Tseng, "Convergence of a block coordinate descent method for nondifferentiable minimization," J. Optimiz. Theory Appl., vol. 109, pp. 475-494, 2001.
47. A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Image Sci., vol. 2, no. 1, pp. 183-202, 2009.
48. B. He, H. Yang, and S.Wang, "Alternating direction method with selfadaptive penalty parameters for monotone variational inequalities," J. Optimiz. Theory Appl., vol. 106, no. 2, pp. 337-356, 2000.
49. S. Wang and L. Liao, "Decomposition method with a variable parameter for a class of monotone variational inequality problems," J. Optimiz. Theory Appl., vol. 109, no. 2, pp. 415-429, 2001.
50. E. Berg, M. Friedlander, G. Hennenfent, F. Herrmann, R. Saab, and Ö. Yilmaz, Sparco: A Testing Framework for Sparse Reconstruction Dep. Comput. Sci., Univ. British Columbia, Vancouver, Tech. Rep., 2007.
51. M. Grant and S. Boyd, "CVX: Matlab software for disciplined convex programming, version 1.21,".
52. P. Erdos and A. Renyi, "On random graphs," Publicationes Math., vol. 6, pp. 290-297, 1959.
53. D. Watts and S. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, no. 6684, pp. 409-410, 1998.
54. A. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, 1999.
55. M. Penrose, Random Geometric Graphs. Oxford, U.K.: Oxford Univ. Press, 2004.
56. E. Scheinerman, "Matgraph: A graph theory toolbox for MATLAB," [Online]. Available: http://www.ams.jhu.edu/~ers/matgraph
57. J. Mota, J. Xavier, P. Aguiar, and M. Püschel, "A proof of convergence for the alternating direction method of multipliers applied to polyhedralconstrained functions," 2011 [Online]. Available: http://arxiv.org/abs/1112.2295
58. B. He and X. Yuan, "On the convergence rate of alternating direction method," [Online]. Available: http://www.optimization-online. org/DB-HTML/2011/09/3157.html 2011
59. P. Combettes and J. Pesquet, "Proximal splittingmethods in signal processing," in Fixed-Point Algorithms for Inverse Problems in Science and Engineering. New York: Springer, 2010.
60. A. Chambolle and T. Pock, "A first-order primal-dual algorithm for convex problems with applications to imaging," J. Math. Imaging and Vision, vol. 40, no. 1, 2011.
61. B. He, M. Tao, and X. Yuan, "Alternating direction method with Gaussian back substitution for separable convex programmming," [Online]. Available: http://www.optimization-online. org/DB-HTML/2010/12/2871.html 2010
62. B. He, M. Tao, and X. Yuan, "A splitting method for separate convex programming with linking linear constraints," [Online]. Available: http://www.optimization-online.org/DB-HTML/2010/06/2665.html 2010
63. B.He, M. Tao, M. Xu, and X.Yuan, "Alternating directions based contraction method for generally separable linearly constrained convex programming problems," [Online]. Available: http://www.optimization- online.org/DB-HTML/2009/11/2465.html 2010
64. B. He and X. Yuan, "Linearized alternating direction method with Gaussian back substitution for separable convex programming," [Online]. Available: http://www.optimization-online. org/DB-HTML/2011/10/3192.html 2011
65. Y. Narushima, T. Wakamatsu, and H. Yabe, "Extended Barzilai-Borwein method for the unconstrained minimization problems," Pacific J. Opt., vol. 6, no. 3, 2010.