Convergence of Min-Sum Message-Passing for Convex Optimization

DOI10.1109/TIT.2010.2040863zbMATH Open1366.90162OpenAlexW2151173657MaRDI QIDQ5281554FDOQ5281554

Authors: Ciamac C. Moallemi, Benjamin Van Roy 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2010.2040863

Mathematics Subject Classification ID

Convex programming (90C25) Analysis of algorithms (68W40)

Cited In (6)

• Convergence of Min-Sum Message Passing for Quadratic Optimization
• A new approach to Laplacian solvers and flow problems
• The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
• On the convergence of Gaussian belief propagation with nodes of arbitrary size
• Linear coordinate-descent message passing for quadratic optimization
• Distributed algorithms for aggregative games on graphs

This page was built for publication: Convergence of Min-Sum Message-Passing for Convex Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281554)