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.

References in corpus (1)

• Consensus Propagation

Cited by in corpus (5)

• Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
• Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application
• Convergence of Min-Sum Message Passing for Quadratic Optimization
• The Impact of Mobility on Gossip Algorithms
• Correlation Decay in Random Decision Networks