Gesualdo Scutari

From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing

We study the minimization of sums of smooth strongly convex functions over undirected graphs, with each function held by one agent and communication restricted to neighbors in the graph. Existing decentralized methods, whether based on gossip or on routing over spanning trees, typically use the network to mix or aggreg...