Achieving Geometric Convergence for Distributed Optimization over Time-Varying Graphs

20 Mar 2017 Nedich Angelia Olshevsky Alex Shi Wei

This paper considers the problem of distributed optimization over time-varying graphs. For the case of undirected graphs, we introduce a distributed algorithm, referred to as DIGing, based on a combination of a distributed inexact gradient method and a gradient tracking technique... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • OPTIMIZATION AND CONTROL