.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
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
Journal
IF:
5
Papers:
1.7K
Citations:
5.8K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more