Zero gradient sum algorithm of arbitrary initial value with constraints and communication delay based on directed graph.
Saved in:
| Title: | Zero gradient sum algorithm of arbitrary initial value with constraints and communication delay based on directed graph. |
|---|---|
| Authors: | Lin, Siman, Zhang, Xiaotang, Ren, Junwu, Tan, Manchun |
| Source: | International Journal of Systems Science; Jan2025, Vol. 56 Issue 2, p267-292, 26p |
| Subject Terms: | LYAPUNOV functions, MACHINE learning, TOPOLOGY, ALGORITHMS, SAMPLING methods |
| Abstract: | The distributed convex optimisation issue with inequality constraints and box constraints on the directed communication topology is examined in this paper. In the case of the communication delay between agents, we propose a piecewise zero-gradient-sum triggered control algorithm that allows arbitrary initial values. Using the log-barrier penalty method, we only need to study an unconstrained approximation problem of the original problem. Firstly, each agent's state converges to the optimal value of the related local objective function in a fixed time. Simultaneously, the upper bound of fixed time in this paper is smaller than some existing results. Then, in the case of communication delay, time-triggered and event-triggered methods with non-uniform sampling interval are proposed in this paper, which make the communication cost lower and the application broader. Using the Lyapunov function method, the sufficient conditions for each agent's state to converge to the optimal point are given, and the Zeno behaviour is excluded. Finally, to confirm the algorithm's effectiveness, we provide two numerical examples and one machine learning example as demonstrations. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Systems Science is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!