Convergence of Min-Sum Message Passing for Quadratic Optimization
From MaRDI portal
Publication:4975868
Abstract: 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.
Recommendations
- Convergence of Min-Sum Message-Passing for Convex Optimization
- Message-passing algorithms for quadratic minimization
- Linear coordinate-descent message passing for quadratic optimization
- Convergence-Optimal Quantizer Design of Distributed Contraction-Based Iterative Algorithms With Quantized Message Passing
- On the Convergence of Approximate Message Passing With Arbitrary Matrices
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence Properties of Message-Passing Algorithm for Distributed Convex Optimisation With Scaled Diagonal Dominance
- Convergence of the steepest descent method for minimizing quasiconvex functions
Cited in
(6)- A new approach to Laplacian solvers and flow problems
- Convergence of Gaussian belief propagation under general pairwise factorization: connecting Gaussian MRF with pairwise linear Gaussian model
- On the convergence of Gaussian belief propagation with nodes of arbitrary size
- Convergence analysis of distributed inference with vector-valued Gaussian belief propagation
- Linear coordinate-descent message passing for quadratic optimization
- scientific article; zbMATH DE number 7255132 (Why is no real title available?)
This page was built for publication: Convergence of Min-Sum Message Passing for Quadratic Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975868)
