.png){kind=icon}
返回
Accelerated Gradient Flow for Directed Graphs With Event-Based Broadcasting
.png){kind=icon}
PRE
AI
DOI：10.1109/TCNS.2023.3290112.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Accelerated gradients algorithms are currently at the receiving end of widespread interest in optimization theory, both under discrete- and continuous-time (CT) frameworks. In light of recent developments, in the first part of our work, we design a CT accelerated gradient algorithm for strongly connected directed graphs. We show that the convergence is exponential and the convergence rate is proportional to the gradient gain which is chosen arbitrarily. To facilitate implementation of the algorithm over communication networks, in the second part of our work, we design an event-based broadcasting protocol that intermittently checks for events by evaluating an event-triggering condition and accordingly makes decision on broadcasting. The distributed system, with CT dynamics and discrete-time (event-based) broadcasts, is reformulated as a hybrid dynamical system which is devoid of Zeno solutions. Finally, we provide a numerical example to demonstrate our results.
Keyword:
Directed graphs
Convergence
Laplace equations
Control systems
Network systems
Broadcasting
Protocols
Accelerated gradient algorithm
asynchronous broadcasts
directed graphs
event-based broadcasting
continuous-time (CT) distributed optimization
期刊
IF:
5
论文数:
1.7K
被引数:
5.8K
机构
引用论文
.png){kind=icon}
分享收藏
A Distributed Hybrid Event-Time-Driven Scheme for Optimization Over Sensor Networks一种分布式混合事件时间驱动的传感器网络优化方案
PREAI
分享收藏
查看更多内容