Resource allocation via message passing

INFORMS Journal on Computing

Volumn 23, Issue 2, 2011, Pages 205-219

  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; Min sum algorithm; Resource allocation

Indexed keywords

EID: 79955775746     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0395     Document Type: Article

References (50)

1. Aldous, D. 1992. Asymptotics in the random assignment problem. Probab. Theory Related Fields 93 507-534.
2. Aldous, D. 2001. The f (2) limit in the random assignment problem. Random Struct. Algorithms 18 (4) 381-418.
3. Aldous, D., J. M. Steele. 2003. The objective method: Probabilistic combinatorial optimization and local weak convergence. H. Kesten, ed. Probability on Discrete Structures. Springer, Berlin, 1-72.
4. Aliprantis, C. D., R. Tourky, N. C. Yannelis. 2001. A theory of value with non-linear prices: Equilibrium analysis beyond vector lattices. J. Econom. Theory 100 (1) 22-72. (Pubitemid 33082644)
5. Arrow, K. J., L. Hurwicz, eds. 1977. Studies in Resource Allocation. Cambridge University Press, Cambridge, UK.
6. Aurell, E., U. Gordon, S. Kirkpatrick. 2005. Comparing beliefs, surveys, and random walks. L. K. Saul, Y. Weiss, L. Bottou, eds. Advances in Neural Information Processing Systems, Vol. 17. MIT Press, Cambridge, MA, 49-56.
7. Bayati, M., D. Shah, M. Sharma. 2005. Maximum weight matching via max-product belief propagation. Proc. IEEE Internat. Sympos. Inform. Theory, Adelaide, Australia. IEEE, New York, 1763-1767. (Pubitemid 44508347)
8. Benedetto, S., D. Divsalar, G. Montorsi, F. Pollara. 1996. Soft-output decoding algorithms in iterative decoding of turbo codes. Telecommunications and Data Acquisition Progress Report 42-142, NASA Jet Propulsion Laboratory, Pasadena, CA, 63-87.
9. Berliant, M., K. Dunz. 1990. Nonlinear supporting prices: The superadditive case. J. Math. Econom. 19 (4) 357-367.
10. Berrou, C., A. Glavieux, P. Thitimajshima. 1993. Near Shannon limit error-correcting coding and decoding: Turbo-codes. Proc. IEEE Internat. Comm. Conf., Geneva, Vol. 2. IEEE, New York, 1064-1070. (Pubitemid 23674800)
11. Bertsekas, D. P. 1982. Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York.
12. Braunstein, A., R. Zecchina. 2004. Survey propagation as local equilibrium equations. J. Statist. Mech. 2004 PO6007.
13. Braunstein, A., M. Mézard, R. Zecchina. 2005. Survey propagation: An algorithm for satisfiability. Random Struct. Algorithms 27 (2) 201-226. (Pubitemid 41482546)
14. Coughlan, J. M., S. J. Ferreira. 2002. Finding deformable shapes using loopy belief propagation. Eur. Conf. Comput. Vision. Lecture Notes in Computer Science, Vol. 2352. Springer, Berlin, 53-73.
15. Fazel, M., M. Chiang. 2005. Network utility maximization with nonconcave utilities using sum-of-squares method. Proc. 44th Conf. Decision Control, Vol. 2. IEEE, New York, 1867-1874. (Pubitemid 46297241)
16. Freeman, W. T., E. C. Pasztor, O. T. Carmichael. 2000. Learning lowlevel vision. Internat. J. Comput. Vision 40 (1) 25-47.
17. Fréville, A. 2004. The multidimensional 0-1 knapsack problem: An overview. Eur. J. Oper. Res. 155 (1) 1-21.
18. Frey, B. J. 1998. Graphical Models for Machine Learning and Digital Communication. MIT Press, Cambridge, MA.
19. Gamarnik, D., T. Nowicki, G. Swirscsz. 2005. Maximum weight independent sets and matchings in sparse random graphs: Exact results using the local weak convergence method. Random Struct. Algorithms 28 (1) 76-106. (Pubitemid 43468942)
20. Hande, P., S. Zhang, M. Chiang. 2005. Distributed rate allocation for inelastic flows. IEEE/ACM Trans. Networking 15 (6) 1240-1253.
21. Kellerer, H., U. Pferschy, D. Pisinger. 2004. Knapsack Problems. Springer, Berlin.
22. Kelly, F. 1997. Charging and rate control for elastic traffic. Eur. Trans. Telecomm. 8 (1) 33-37. (Pubitemid 127443030)
23. Lee, J. W., R. R. Mazumdar, N. B. Shroff. 2005. Non-convex optimization and rate control for multi-class services in the Internet. IEEE/ACM Trans. Networking 13 (4) 841-853.
24. Leone, M., A. Pagnani. 2005. Predicting protein functions with message passing algorithms. Bioinformatics 21 (2) 239-247. (Pubitemid 40202025)
25. Letovsky, S., S. Kasif. 2003. Predicting protein function from protein/protein interaction data: A probabilistic approach. Bioinformatics 19 (Supplement 1) i197-i204. (Pubitemid 41185619)
26. Malioutov, D. M., J. K. Johnson, A. S. Willsky. 2006. Walk-sums and belief propagation in Gaussian graphical models. J. Machine Learn. Res. 7 (December) 2031-2064. (Pubitemid 44497455)
27. Maneva, E. N., E. Mossel, M. J. Wainwright. 2005. A new look at survey propagation and its generalizations. Proc. 16th Annual ACM-SIAM Sympos. Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1089-1098. (Pubitemid 40851477)
28. McCallum, A. 2003. Efficiently inducing features of conditional random fields. C. Meek, U. Kjærulff, eds. Proc. 19th Conf. Uncertainty Artificial Intelligence, Morgan Kaufmann, San Francisco, 403-410.
29. Mézard, M., G. Parisi, R. Zecchina. 2002. Analytic and algorithmic solution of random satisfiability problems. Science 297 (5582) 812-815. (Pubitemid 34839626)
30. Moallemi, C. C., B. Van Roy. 2006. Consensus propagation. IEEE Trans. Inform. Theory 52 (11) 4753-4766. (Pubitemid 44680572)
31. Moallemi, C. C., B. Van Roy. 2007. Convergence of the minsum algorithm for convex optimization. Technical report, Management Science and Engineering Department, Stanford University, Stanford, CA.
32. Moallemi, C. C., B. Van Roy. 2009. Convergence of min-sum message passing for quadratic optimization. IEEE Trans. Inform. Theory 55 (5) 2413-2423.
33. Montanari, A., D. Tse. 2006. Analysis of belief propagation for nonlinear problems: The example of CDMA (or: How to prove Tanaka's formula). Proc. IEEE Inform. Theory Workshop, Punta del Este, Uruguay, 160-164. (Pubitemid 44754526)
34. Montanari, A., B. Prabhakar, D. Tse. 2005. Belief propagation based multi-user detection. Proc. 43rd Allerton Conf. Comm. Control Comput., Monticello, IL.
35. Mordukhovich, B. S. 2005. Nonlinear prices in nonconvex economies with classical Pareto and strong Pareto optimal allocations. Positivity 9 (3) 541-568. (Pubitemid 41577764)
36. Pinto, D., A. McCallum, X. Wei, W. B. Croft. 2003. Table extraction using conditional random fields. Proc. 26th Annual Internat. ACM SIGIR Conf. Res., Dev. Inform., ACM, New York, 235-242.
37. Richardson, T., R. Urbanke. 2001a. An introduction to the analysis of iterative coding systems. B. Marcus, J. Rosenthal, eds. Codes, Systems, and Graphical Models. IMA Volume in Mathmatics and Its Applications. Springer, New York, 1-37.
38. Richardson, T., R. Urbanke. 2001b. The capacity of low-density parity check codes under message-passing decoding. IEEE Trans. Inform. Theory 47 (2) 599-618. (Pubitemid 32318092)
39. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
40. Rockafeller, R. T. 1974. Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J. Control 12 (2) 268-285.
41. Rusmevichientong, P., B. Van Roy. 2001. An analysis of belief propagation on the turbo decoding graph with Gaussian densities. IEEE Trans. Inform. Theory 47 (2) 745-765. (Pubitemid 32318101)
42. Shenker, S. 1995. Fundamental design issues for the future Internet. IEEE J. Selected Areas Comm. 13 (7) 1176-1188.
43. Spence, M. 1977. Nonlinear prices and welfare. J. Public Econom. 8 (1) 1-18.
44. Sun, J., H.-Y. Shum, N.-N. Zheng. 2002. Stereo matching using belief propagation. Eur. Conf. Comput. Vision (ECCV 2002). Lecture Notes in Computer Science, Vol. 2351. Springer, Berlin, 450-452.
45. Sutton, C. A., K. Rohanimanesh, A. McCallum. 2004. Dynamic conditional random fields: Factorized probabilistic models for labeling and segmenting sequence data. Proc. 21st Internat. Conf. Machine Learn. ACM Internat. Conf. Proc. Ser., Vol. 69. ACM, New York, 99.
46. Talagrand, M. 2003. Spin Glasses: A Challenge for Mathematicians: Cavity and Mean Field Models. Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 46. Springer, Berlin.
47. Tatikonda, S. C., M. I. Jordan. 2002. Loopy belief propagation and Gibbs measures. A. Darwiche, N. Friedman, eds. Proc. 18th Conf. Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, 493-500.
48. Wainwright, M. J., T. Jaakkola, A. S. Willsky. 2004. Tree consistency and bounds on the performance of the max-product algorithm and its generalizations. Statist. Comput. 14 (2) 143-166. (Pubitemid 39051297)
49. Weiss, Y., W. T. Freeman. 2001a. Correctness of belief propagation in Gaussian graphical models of arbitrary topology. Neural Comput. 13 (10) 2173-2200. (Pubitemid 33676880)
50. Weiss, Y., W. T. Freeman. 2001b. On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs. IEEE Trans. Inform. Theory 47 (2) 736-744. (Pubitemid 32318100)