2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/213397We 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.Information TheoryArtificial Intelligencetext