Convergence of the Min-Sum Algorithm for Convex Optimization
classification
🧮 math.OC
keywords
algorithmconvexmin-sumoptimizationasynchronousclassconvergeconvergence
read the original abstract
We establish that the min-sum message-passing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.