.png){kind=icon}
Return
Primal-dual stochastic distributed algorithm for constrained convex optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2019.07.018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates distributed convex optimization problems over an undirected and connected network, where each node's variable lies in a private constrained convex set, and overall nodes aim at collectively minimizing the sum of all local objective functions. Motivated by a variety of applications in machine learning problems with large-scale training sets distributed to multiple autonomous nodes, each local objective function is further designed as the average of moderate number of local instantaneous functions. Each local objective function and constrained set cannot be shared with others. A primal-dual stochastic algorithm is presented to address the distributed convex optimization problems, where each node updates its state by resorting to unbiased stochastic averaging gradients and projects on its private constrained set. At each iteration, for each node the gradient of one local instantaneous function selected randomly is evaluated and the average of the most recent stochastic gradients is used to approximate the true local gradient. In the constrained case, we show that with strong-convexity of the local instantaneous function and Lipschitz continuity of its gradient, the algorithm converges to the global optimization solution almost surely. In the unconstrained case, an explicit linear convergence rate of the algorithm is provided. Numerical experiments are presented to demonstrate correctness of the theoretical results. (C) 2019 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keywords:
Constrained convex optimization
Machine learning
Primal-dual algorithm
Stochastic averaging gradients
Linear convergence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3.7
Papers:
6.4K
Citations:
1.5W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveDistributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs
PREAI
ShareSave
ShareSave
View more