Treffer: Convergence of Min-Sum Message Passing for Quadratic Optimization

Title:
Convergence of Min-Sum Message Passing for Quadratic Optimization
Source:
IEEE transactions on information theory. 55(5):2413-2423
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2009.
Publication Year:
2009
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Graduate School of Business, Columbia University, New York, NY 10025, United States
Departments of Management Science and Engineering and Electrical Engineering, Stanford University, Stanford, CA 94305, United States
ISSN:
0018-9448
Rights:
Copyright 2009 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.21742647
Database:
PASCAL Archive

Weitere Informationen

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.