Convergence of min-sum message passing for quadratic optimization

IEEE Transactions on Information Theory

Volumn 55, Issue 5, 2009, Pages 2413-2423

  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

Decentralized optimization; Message passing algorithms

Indexed keywords

BELIEF PROPAGATION; CONVEX DECOMPOSITION; DECENTRALIZED OPTIMIZATION; GAUSSIAN; MESSAGE PASSING ALGORITHM; MESSAGE-PASSING ALGORITHMS; MIN-SUM; QUADRATIC OBJECTIVE FUNCTIONS; QUADRATIC OPTIMIZATION;

BINARY CODES; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION;

MESSAGE PASSING;

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

References (14)

1. R. G. Gallager, Low-Density Parity Check Codes. Cambridge, MA: M.I.T. 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. 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.
5. 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, pp. 745-765, 2001.
6. 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, pp. 1120-1146, 2003.
7. C. C. Moallemi and B. Van Roy, "Consensus propagation," IEEE Trans. Inf. Theory, vol. 52, pp. 4753-4766, 2006.
8. A. Montanari, B. Prabhakar, and D. Tse, "Belief propagation based multi-user detection," in Proc. Allerton Conf. Commun., Control, and Comput., 2005.
9. J. K. Johnson, D. M. Malioutov, and A. S. Willsky, "Walk-sum interpretation and analysis of Gaussian belief propagation," in Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 2006, vol. 18.
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. J. Wainwright, T. Jaakkola, and A. S. Willsky, "Tree consistency and bounds on the performance of the max-product algorithm and its generalizations," Statist. Comput., vol. 14, pp. 143-166, 2004.
12. C. C. Moallemi and B. Van Roy, "Convergence of the Min-Sum Algorithm for Convex Optimization," Tech. Rep. Stanford Univ., Manage. Sci. Eng. Dep., 2007 [Online]. Available: http://moallemi.com/ciamac/papers/ cc-2007.pdf
13. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.
14. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.