.png){kind=icon}
返回
Continuous-Time Coordination Algorithm for Distributed Convex Optimization Over Weight-Unbalanced Directed Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TCSII.2018.2878250.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A distributed convex optimization problem over a weight-unbalanced directed network is studied in this brief, where the global objective function is equal to the sum of strongly convex objective functions with globally Lipschitz gradients. With respect to the optimization problem, a new continuous-time coordination algorithm is proposed to compute its optimal solution in a distributed manner. The asymptotical convergence of the proposed algorithm is guaranteed by resorting to the direct sum decomposition technique, Kronecker matrix algebra, the stability of perturbed systems, and input-to-state stability. Finally, some simulations are performed to illustrate the theoretical result.
Keyword:
Distributed convex optimization
continuous-time coordination algorithm
directed network
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
.png){kind=icon}
Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
PREAI
分享收藏
查看更多内容