Accelerated Consensus via Min-Sum Splitting
From MaRDI portal
Publication:6287780
arXiv1706.03807MaRDI QIDQ6287780FDOQ6287780
Authors: Patrick Rebeschini, Sekhar Tatikonda 
Publication date: 12 June 2017
Abstract: We apply the Min-Sum message-passing protocol to solve the consensus problem in distributed optimization. We show that while the ordinary Min-Sum algorithm does not converge, a modified version of it known as Splitting yields convergence to the problem solution. We prove that a proper choice of the tuning parameters allows Min-Sum Splitting to yield subdiffusive accelerated convergence rates, matching the rates obtained by shift-register methods. The acceleration scheme embodied by Min-Sum Splitting for the consensus problem bears similarities with lifted Markov chains techniques and with multi-step first order methods in convex optimization.
This page was built for publication: Accelerated Consensus via Min-Sum Splitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6287780)
