arrow
返回

Distributed Aggregative Optimization via Finite-Time Dynamic Average Consensus

delete2023-01-01
delete9
PRE
AI
M
Mingfei Chen
王
王东 (Dong Wang) *
X
Xiaodong Wang
Z
Zheng‐Guang Wu
王
王伟 (Wei Wang)
DOI:10.1109/TNSE.2023.3253143delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper studies the distributed aggregative optimization problem with local constraint sets over an undirected graph. The local objective function of each agent depends on its own decision variables and an aggregation function composed of all agents' decision variables. Taking advantage of the dynamic average consensus method and the projection operator, a continuous-time algorithm with nonuniform gradient gains is proposed to seek the optimal decision variable, which only requires the sign of relative state information between agents' neighbours and has an advantage in reducing communication cost. It is proved that auxiliary variables for estimating the aggregation function achieve consensus in finite time and the proposed algorithm converges asymptotically to the optimal decision variable based on the Lyapunov stability theory. Finally, numerical examples are provided to show the effectiveness of theoretical results.
Keyword:
Aggregative optimization
distributed algorithm
finite-time consensus
nonuniform gradient gains

期刊

I
IEEE Transactions on Network Science and Engineering
IF:
7.9
论文数:
2.6K
被引数:
10.0K

机构

D
Dalian University of Technology
学者数:
6.0W
论文数: 4.4W
被引数: 5.5W
C
Chengdu University
学者数:
6.1K
论文数: 5.0K
被引数: 1.5W
Z
zhejiang university
学者数:
17.7W
论文数: 12.1W
被引数: 152
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Distributed Mirror Descent for Online Composite Optimization
err2021-02-01
err60
errOAAI
errYuan, Deming; Hong, Yiguang; Ho, Daniel W. C.; Xu, Shengyuan
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容