Abstract
We establish the convergence of the min-sum message passing algorithm for minimization of a quadratic objective function given a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation.
Full Citation
.
“Convergence of min-sum message passing for quadratic optimization.”
IEEE Transactions on Information Theory
vol.
55
,
(May 01, 2009):
2413
-2423
.