Convergence of Min-Sum Message Passing for Quadratic Optimization
<|reference_start|>Convergence of Min-Sum Message Passing for Quadratic Optimization: We establish the convergence of the min-sum message passing algorithm for minimization of a broad class of quadratic objective functions: those that admit a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation.<|reference_end|>
@article{moallemi2006convergence,
    title={Convergence of Min-Sum Message Passing for Quadratic Optimization},
    author={Ciamac C. Moallemi and Benjamin Van Roy},
    journal={arXiv preprint arXiv:cs/0603058},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0603058},
    primaryClass={cs.IT cs.AI math.IT}
}