.png){kind=icon}
返回
Distributed Subgradient-Based Multiagent Optimization With More General Step Sizes
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2017.2763782.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A wider selection of step sizes is explored for the distributed subgradient algorithm for multigent optimization problems with time-varying and balanced communication topologies. The square summable requirement of the step sizes commonly adopted in the literature is removed. The step sizes are only required to be positive, vanishing, and nonsummable, which provides the possibility for better convergence rates. Both unconstrained and constrained optimization problems are considered. It is proved that the agents' estimates reach a consensus and converge to the minimizer of the global objective function with the more general choice of step sizes. The best convergence rate is shown to be the reciprocal of the square root of iterations for the best record of the function value at the average of the agents' estimates for the unconstrained case with the wider selection of step sizes. A simulation example is provided to show the effectiveness of the results.
Keyword:
Cooperative control
distributed optimization
step sizes
switching topologies
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
分享收藏
Distributed multi-agent optimization subject to nonidentical constraints and communication delays.png)
AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAI分享收藏
查看更多内容