.png){kind=icon}
返回
Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2013.2278132.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This technical note studies the continuous-time distributed optimization of a sum of convex functions over directed graphs. Contrary to what is known in the consensus literature, where the same dynamics works for both undirected and directed scenarios, we show that the consensus-based dynamics that solves the continuous-time distributed optimization problem for undirected graphs fails to converge when transcribed to the directed setting. This study sets the basis for the design of an alternative distributed dynamics which we show is guaranteed to converge, on any strongly connected weight-balanced digraph, to the set of minimizers of a sum of convex differentiable functions with globally Lipschitz gradients. Our technical approach combines notions of invariance and cocoercivity with the positive definiteness properties of graph matrices to establish the results.
Keyword:
Directed graphs
distributed optimization
networked control systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
分享收藏
分享收藏分享收藏Consensus and cooperation in networked multi-agent systems网络化多智能体系统的共识与合作.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏Adenylate Cyclases of
Trypanosoma brucei
Inhibit the Innate Immune Response of the HostScience
ScienceIF0
PREAI
分享收藏
查看更多内容