Convergence of Min-Sum Message Passing for Quadratic Optimization

Simple item page
dc.creatorMoallemi, Ciamac C.
dc.creatorVan Roy, Benjamin
dc.date2006-03-14
dc.date2008-12-24
dc.date.accessioned2026-07-07T12:21:38Z
dc.date.available2026-07-07T12:21:38Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0603058
dc.identifierhttp://arxiv.org/abs/cs/0603058
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/213397
dc.subjectInformation Theory
dc.subjectArtificial Intelligence
dc.titleConvergence of Min-Sum Message Passing for Quadratic Optimization
dc.typetext

Files

Collections

arXiv