Convergence of the Min-Sum Algorithm for Convex Optimization

Abstract

We establish that the min-sum message-passing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems.