Convergence of Min-Sum Message-Passing for Convex Optimization

DOI10.1109/TIT.2010.2040863zbMath1366.90162OpenAlexW2151173657MaRDI QIDQ5281554

Ciamac Cyrus 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

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

Related Items (5)

Unnamed Item ⋮ The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP ⋮ Distributed Algorithms for Aggregative Games on Graphs ⋮ A New Approach to Laplacian Solvers and Flow Problems ⋮ Linear Coordinate-Descent Message Passing for Quadratic Optimization

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