.png){kind=icon}
返回
Distributed accelerated optimization algorithms: Insights from an ODE
.png){kind=icon}
PRE
AI
DOI：10.1007/s11431-020-1596-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider the distributed optimization problem, where the goal is to minimize the global objective function formed by a sum of agents' local smooth and strongly convex objective functions, over undirected connected graphs. Several distributed accelerated algorithms have been proposed for solving such a problem in the existing literature. In this paper, we provide insights for understanding these existing distributed algorithms from an ordinary differential equation (ODE) point of view. More specifically, we first derive an equivalent second-order ODE, which is the exact limit of these existing algorithms by taking the small step-size. Moreover, focusing on the quadratic objective functions, we show that the solution of the resulting ODE exponentially converges to the unique global optimal solution. The theoretical results are validated and illustrated by numerical simulations.
Keyword:
distributed accelerated optimization algorithms
exponential convergence
ordinary differential equation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
5.0K
被引数:
9.9K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Leader-to-Formation Stability of Multiagent Systems: An Adaptive Optimal Control Approach多智能体系统的领导者到编队稳定性: 一种自适应最优控制方法
OAAI
OAAI分享收藏
查看更多内容