.png){kind=icon}
返回
Distributed Adaptive Convex Optimization on Directed Graphs via Continuous-Time Algorithms
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2017.2750103.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This note considers the distributed optimization problem on directed graphs with nonconvex local objective functions and the unknown network connectivity. A new adaptive algorithm is proposed to minimize a differentiable global objective function. By introducing dynamic coupling gains and updating the coupling gains using relative information of system states, the nonconvexity of local objective functions, unknown network connectivity, and the uncertain dynamics caused by locally Lipschitz gradients are tackled concurrently. Consequently, the global asymptotic convergence is established when the global objective function is strongly convex and the gradients of local objective functions are only locally Lipschitz. When the communication graph is strongly connected and weight-balanced, the algorithm is independent of any global information. Then, the algorithm is naturally extended to unbalanced directed graphs by using the left eigenvector of the Laplacian matrix associated with the zero eigenvalue. Several numerical simulations are presented to verify the results.
Keyword:
Adaptive control
consensus control
distributed convex optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Pheochromocytoma Crisis Caused by Contemporary Ergotamine, Caffeine, and Nimesulide Administration
PREAI
分享收藏Distributed adaptive consensus and output tracking of unknown linear systems on directed graphs有向图上未知线性系统的分布式自适应一致性和输出跟踪.png)
AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAI分享收藏分享收藏Synthesis of Cu3P nanocubes and their excellent electrocatalytic efficiency for the hydrogen evolution reaction in acidic solutionRSC Advances
RSC AdvancesIF0
PREAI
分享收藏分享收藏
查看更多内容