.png){kind=icon}
.png){kind=icon}
Return
Accelerated Distributed Nesterov Gradient Descent
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2019.2937496.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 method. When the objective function is convex and L-smooth, we show that it achieves a O(1/t(1.4-epsilon)) convergence rate for all epsilon is an element of (0, 1.4). We also show the convergence rate can be improved to O(1/t(2)) if the objective function is a composition of a linear map and a strongly convex and smooth function. When the objective function is mu-strongly convex and L-smooth, we show that it achieves a linear convergence rate of O([1 - C(mu/L)(5/7)](t)), where L/mu is the condition number of the objective, and C > 0 is some constant that does not depend on L/mu.
Keywords:
Convergence
Acceleration
Convex functions
Radio frequency
Linear programming
Gradient methods
Distributed algorithms
multiagent systems
optimization methods
distributed optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W