.png){kind=icon}
返回
Achieving Linear Convergence in Distributed Asynchronous Multiagent Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2020.2977940.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article studies multiagent (convex and nonconvex) optimization over static digraphs. We propose a general distributed asynchronous algorithmic framework whereby 1) agents can update their local variables as well as communicate with their neighbors at any time, without any form of coordination; and 2) they can perform their local computations using (possibly) delayed, out-of-sync information from the other agents. Delays need not be known to the agent or obey any specific profile, and can also be time-varying (but bounded). The algorithm builds on a tracking mechanism that is robust against asynchrony (in the above sense), whose goal is to estimate locally the average of agents' gradients. When applied to strongly convex functions, we prove that it converges at an R-linear (geometric) rate as long as the step-size is sufficiently small. A sublinear convergence rate is proved, when nonconvex problems and/or diminishing, uncoordinated step-sizes are considered. To the best of our knowledge, this is the first distributed algorithm with provable geometric convergence rate in such a general asynchronous setting. Preliminary numerical results demonstrate the efficacy of the proposed algorithm and validate our theoretical findings.
Keyword:
Delays
Convergence
Optimization
Convex functions
Distributed algorithms
Robustness
Indexes
Asynchrony
delay
directed graphs
distributed optimization
linear convergence
nonconvex optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization坐标下降原始对偶算法及其在分布式异步优化中的应用OAAI
OAAI分享收藏An Efficient and Rapid Synthesis of 2-amino-4-arylthiazoles Employing Microwave Irradiation in WaterOAAI
OAAI分享收藏
查看更多内容