S-DIGing: A Stochastic Gradient Tracking Algorithm for Distributed Optimization

In this article, we study convex optimization problems where agents of a network cooperatively minimize the global objective function which consists of multiple local objective functions. The intention of this work is to solve large-scale optimization problems where the local objective function is c...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on emerging topics in computational intelligence Ročník 6; číslo 1; s. 53 - 65
Hlavní autori: Li, Huaqing, Zheng, Lifeng, Wang, Zheng, Yan, Yu, Feng, Liping, Guo, Jing
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 01.02.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Approximation algorithms
Computational geometry
Convergence
Convex functions
Convexity
Distributed optimization
gradient tracking
linear convergence
Linear programming
Machine learning algorithms
multi-agent systems
Optimization
stochastic averaging gradient
Stochastic processes
Tracking
Upper bounds
ISSN:2471-285X, 2471-285X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this article, we study convex optimization problems where agents of a network cooperatively minimize the global objective function which consists of multiple local objective functions. The intention of this work is to solve large-scale optimization problems where the local objective function is complicated, and numerous. Different from most of the existing works, the local objective function of each agent is presented as the average of finite instantaneous functions. Integrating the gradient tracking algorithm with stochastic averaging gradient technology, a distributed stochastic gradient tracking (termed as S-DIGing) algorithm is proposed. At each time instant, only one randomly selected gradient of an instantaneous function is computed, and applied to approximate the local batch gradient for each agent. Based on a novel primal-dual interpretation of the S-DIGing algorithm, it is shown that the S-DIGing algorithm linearly converges to the global optimal solution when step-size do not exceed an explicit upper bound, and the instantaneous functions are strongly convex with Lipschitz continuous gradients. Numerical experiments are presented to demonstrate the practicability of the S-DIGing algorithm, and correctness of the theoretical results.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2471-285X
2471-285X
DOI:10.1109/TETCI.2020.3017242