Convergence of Min-Sum Message-Passing for Convex Optimization


We establish that the min-sum message-passing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems, generalizing existing results for pairwise quadratic optimization problems. The main sufficient condition is that of scaled diagonal dominance. This condition is similar to known sufficient conditions for asynchronous convergence of other decentralized optimization algorithms, such as coordinate descent and gradient descent.

DOI: 10.1109/TIT.2010.2040863

Extracted Key Phrases

1 Figure or Table

Cite this paper

@article{Moallemi2010ConvergenceOM, title={Convergence of Min-Sum Message-Passing for Convex Optimization}, author={Ciamac C. Moallemi and Benjamin Van Roy}, journal={IEEE Transactions on Information Theory}, year={2010}, volume={56}, pages={2041-2050} }