Bibliographic Details
| Title: |
Distributed optimization algorithm for multi‐agent networks with lazy gradient information. |
| Authors: |
Mo, Lipo, Yang, Yang, Huang, Xiankai |
| Source: |
Asian Journal of Control; Jan2025, Vol. 27 Issue 1, p532-539, 8p |
| Subject Terms: |
OPTIMIZATION algorithms, TELECOMMUNICATION systems, LAZINESS, COMPUTER simulation, ALGORITHMS, DISTRIBUTED algorithms |
| Abstract: |
Based on the so‐called lazy gradient information, this note proposes two communication‐reduced distributed optimization algorithms over undirected multi‐agent networks. The lazy gradients refer to some gradients that do not change much in the past iterations and thus may not be distributed among agents which correspondingly reduces the communication load in the networks. For both the deterministic and the stochastic frameworks, the asymptotic properties of the distributed optimization algorithms are established. Compared with the existing literature using the lazy gradient information, the proposed algorithms in the paper are fully distributed and more suitable for the situation of decentralized multi‐agent networks. The effectiveness of the proposed algorithms is also testified through numerical simulations. [ABSTRACT FROM AUTHOR] |
|
Copyright of Asian Journal of Control is the property of Wiley-Blackwell 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