Convergence of Min-Sum Message Passing for Quadratic Optimization
From MaRDI portal
Publication:4975868
DOI10.1109/TIT.2009.2016055zbMATH Open1367.90075arXivcs/0603058OpenAlexW2057803073MaRDI QIDQ4975868FDOQ4975868
Ciamac C. Moallemi, Benjamin Van Roy
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/cs/0603058
Cited In (6)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence Analysis of Distributed Inference with Vector-Valued Gaussian Belief Propagation
- Title not available (Why is that?)
- A New Approach to Laplacian Solvers and Flow Problems
- Linear coordinate-descent message passing for quadratic optimization
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 👍 👎
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)
