Abstract
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.
Full Citation
.
“Convergence of min-sum message-passing for convex optimization.”
IEEE Transactions on Information Theory
vol.
56
,
(April 01, 2010):
2041
-2050
.