Convergence of Min-Sum Message Passing for Quadratic Optimization

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Information Theory, Artificial Intelligence

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/213397

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0603058
 http://arxiv.org/abs/cs/0603058

Collections

arXiv