We establish that the min-sum message-passing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems.
@article{arxiv.0705.4253,
title = {Convergence of the Min-Sum Algorithm for Convex Optimization},
author = {Ciamac C. Moallemi and Benjamin Van Roy},
journal= {arXiv preprint arXiv:0705.4253},
year = {2007}
}