Convergence of the mim-sum algorithm for convex optimization

45th Annual Allerton Conference on Communication, Control, and Computing 2007

Volumn 2, Issue , 2007, Pages 840-847

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

^a Columbia University ^*  (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MESSAGE PASSING; OPTIMIZATION;

CONVEX OPTIMIZATION PROBLEMS; MESSAGE PASSING ALGORITHM;

CONVEX OPTIMIZATION;

EID: 84940668771     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. R. G. GallageR. Low-Density Parity Check Codes. M.I.T. Press, Cambridge, MA, 1963.
2. C. Berrou, A. Glavieux, and R Thitimajshima. Near Shannon limit error-correcting coding and decoding. In Proc. Int. Communications Conf, pages 1064-1070, Geneva, Switzerlang, May 1993.
3. T. Richardson and R. UrbankE. The capacity of low-density parity check codes under message-passing decoding. IEEE Transactions on Information Theory, 47:599-618, 2001.
4. M. Mezard, G. Parisi, and R. Zecchina. Analytic and algorithmic solutions to random satisfiability problems. Science, 297(5582):812-815, 2002.
5. A. Braunstein, M. Mezard, and R. Zecchina. Survey propagation: An algorithm for satisfiability. Random Struct. Algorithms, 27(2):201-226, 2005.
6. Y. Weiss and W. T. Freeman. Correctness of belief propagation in Gaussian graphical models of arbitrary topology. Neural Computation, 13:2173-2200, 2001.
7. P. Rusmevichientong and B. Van Roy. An analysis of belief propagation on the turbo decoding graph with Gaussian densities. IEEE Transactions on Information Theoiy, 47(2):745-765, 2001.
8. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. Tree-based reparame-terization framework for analysis of sum-product and related algorithms. IEEE Transactions on Information Theory, 49(5): 1120-1146, 2003.
9. C. C. Moallemi and B. Van Roy. Convergence of the min-sum message passing algorithm for quadratic optimization. Technical report, Management Science & Engineering Department, Stanford University, 2006. URL: http://moallemi.com/ciamac/papers/qms-2006.pdf.
10. D. M. Malioutov, J. K. Johnson, and A. S. Willsky. Walk-sums and belief propagation in Gaussian graphical models. Journal of Machine Learning Research, 7:2031-2064, October 2006.
11. C. C. Moallemi and B. Van Roy. Consensus propagation. IEEE Transactions on Information Theory, 52(11):4753-4766, 2006.
12. A. Montanari, B. Prabhakar, and D. TsE. Belief propagation based multi-user detection. In Proceedings of the Allerton Conference on Communication, Control, and Computing, 2005.
13. N. Wiberg. Codes and decoding on general graphs. PhD thesis, Linkoping University, Linkoping, Sweden, 1996.
14. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computa-tion: Numerical Methods. Athena Scientific, Belmont, MA, 1997.