.png){kind=icon}
返回
An accelerated algorithm for distributed optimization with Barzilai-Borwein step sizes
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2022.108748.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distributed optimization algorithms are widely applied in distributed systems where the agents cooperate with each other to find the minimal solution of the problem over a connected network. In this paper, we introduce the adaptive step sizes that are computed automatically with variables and gradients of the last two iterates, which are independent of the underlying network topology and the function property. Moreover, we propose an accelerated algorithm based on the dynamic average consensus approach and the Barzilai-Borwein step sizes and further demonstrate the geometric convergence of the algorithm for the smooth and strongly convex functions. Finally, the numerical experiments are provided to validate the theoretical results and show the efficacy of the proposed algorithm.(c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Distributed optimization
Acceleration
Barzilai-Borwein step sizes
Convergence rate
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容