Convergence of the Min-Sum Algorithm for Convex Optimization
From MaRDI portal
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 page was built for publication: Convergence of the Min-Sum Algorithm for Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6205753)
