Convergence of the Min-Sum Algorithm for Convex Optimization

Simple item page
dc.creatorMoallemi, Ciamac C.
dc.creatorVan Roy, Benjamin
dc.date2007-05-29
dc.date.accessioned2026-07-07T08:03:31Z
dc.date.available2026-07-07T08:03:31Z
dc.descriptionWe establish that the min-sum message-passing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems.
dc.identifierhttps://arxiv.org/abs/0705.4253
dc.identifierhttp://arxiv.org/abs/0705.4253
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129608
dc.subjectOptimization and Control
dc.titleConvergence of the Min-Sum Algorithm for Convex Optimization
dc.typetext

Files

Collections

arXiv