Convergence of min-sum message-passing for convex optimization

IEEE Transactions on Information Theory

Volumn 56, Issue 4, 2010, Pages 2041-2050

  Moallemi, Ciamac C ^a   Van Roy, Benjamin ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b Stanford University   (United States)

Author keywords

Convex optimization; Decentralized optimization; Message passing algorithms

Indexed keywords

CONVEX OPTIMIZATION PROBLEMS; COORDINATE DESCENT; DECENTRALIZED OPTIMIZATION; DIAGONAL DOMINANCE; GRADIENT DESCENT; LARGE CLASS; MESSAGE PASSING ALGORITHM; MESSAGE-PASSING ALGORITHMS; MIN-SUM; QUADRATIC OPTIMIZATION PROBLEMS; SUFFICIENT CONDITIONS;

ALGORITHMS; BINARY CODES; CONVERGENCE OF NUMERICAL METHODS; MESSAGE PASSING; OPTIMIZATION;

CONVEX OPTIMIZATION;

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

References (22)

1. R. G. Gallager, Low-Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding," in Proc. Int. Commun. Conf., Geneva, Switzerland, May 1993, pp. 1064-1070.
3. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol.47, pp. 599-618, 2001.
4. M. Mézard, G. Parisi, and R. Zecchina, "Analytic and algorithmic solutions to random satisfiability problems," Science, vol.297, no.5582, pp. 812-815, 2002.
5. A. Braunstein, M. Mézard, and R. Zecchina, "Survey propagation: An algorithm for satisfiability," Random Struct. Algorithms, vol.27, no.2, pp. 201-226, 2005.
6. Y. Weiss and W. T. Freeman, "Correctness of belief propagation in Gaussian graphical models of arbitrary topology," Neural Computat., vol.13, pp. 2173-2200, 2001.
7. P. Rusmevichientong and B. Van Roy, "An analysis of belief propagation on the turbo decoding graph with Gaussian densities," IEEE Trans. Inf. Theory, vol.47, no.2, pp. 745-765, 2001.
8. M. J. Wainwright, T. Jaakkola, and A. S. Willsky, "Tree-based reparameterization framework for analysis of sum-product and related algorithms," IEEE Trans. Inf. Theory, vol.49, no.5, pp. 1120-1146, 2003.
9. C. C. Moallemi and B. Van Roy, "Convergence of min-sum message passing for quadratic optimization," IEEE Trans. Inf. Theory, vol.55, no.5, pp. 2413-2423, May 2009.
10. D. M. Malioutov, J. K. Johnson, and A. S.Willsky, "Walk-sums and belief propagation in Gaussian graphical models," J. Mach. Learn. Res., vol.7, pp. 2031-2064, Oct. 2006.
11. M. Bayati, C. Borgs, J. Chayes, and R. Zecchina, "On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs," J. Statist. Mechan., vol.6, p. L06001, 2008.
12. M. Bayati, D. Shah, and M. Sharma, "Max-product for maximum weight matching: Convergence, correctness, and LP duality," IEEE Trans. Inf. Theory, vol.54, no.3, pp. 1241-1251, Mar. 2008.
13. B. Huang and T. Jebara, "Loopy belief propagation for bipartite maximum weight b-matching," in Proc. Artif. Intell. Statist. (AISTATS) Conf., 2007.
14. S. Sanghavi, D. Malioutov, and A.Willsky, Belief Propagation and LP Relaxation for Weighted Matching in General Graphs 2008, working paper.
15. S. Sanghavi, D. Shah, and A.Willsky, "Message passing for maximum weight independent set," IEEE Trans. Inf. Theory, 2008, to be published.
16. D. P. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1995.
17. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K. : Cambridge Univ. Press, 2004.
18. C. C. Moallemi and B. Van Roy, "Consensus propagation," IEEE Trans. Inf. Theory, vol.52, no.11, pp. 4753-4766, 2006.
19. A. Montanari, B. Prabhakar, and D. Tse, "Belief propagation based multi-user detection," in Proc. Allerton Conf. Commun., Control, and Comput., 2005.
20. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1990.
21. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
22. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.