.png){kind=icon}
返回
Distributed Adaptive Optimization With Weight-Balancing
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2021.3071651.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article addresses the continuous-time distributed optimization of a strictly convex summation-separable cost function with possibly nonconvex local functions over strongly connected digraphs. Distributed optimization methods in the literature require convexity of local functions, or balanced weights, or vanishing step sizes, or algebraic information (eigenvalues or eigenvectors) of the Laplacian matrix. The solution proposed here covers both weight-balanced and unbalanced digraphs in a unified way, without any of the aforementioned requirements.
Keyword:
Optimization
Eigenvalues and eigenfunctions
Laplace equations
Couplings
Cost function
Radio frequency
Standards
Directed graphs
distributed optimization
multiagent systems
weight balancing
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容