paper

Accelerated Distributed Nesterov Gradient Descent

arXiv:1705.07176 · doi:10.1109/TAC.2019.2937496

Abstract

This paper considers the distributed optimization problem over a network, where the objective is to optimize a global function formed by a sum of local functions, using only local computation and communication. We develop an Accelerated Distributed Nesterov Gradient Descent (Acc-DNGD) method. When the objective function is convex and -smooth, we show that it achieves a convergence rate for all . We also show the convergence rate can be improved to if the objective function is a composition of a linear map and a strongly-convex and smooth function. When the objective function is -strongly convex and -smooth, we show that it achieves a linear convergence rate of , where is the condition number of the objective, and is some constant that does not depend on .

55 pages, 8 figures

References in corpus (4)

Cited by in corpus (10)