A Generic Algorithm Framework for Distributed Optimization Over the Time-Varying Network With Communication Delays

In this article, we study the distributed optimization problem (DOP) over the time-varying communication network topology with communication delays. The existing distributed optimization algorithms (DOAs) cannot be directly applied to DOPs over the time-varying network with communication delays. In...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 69; no. 1; pp. 371 - 378
Main Authors Liu, Jie, Ho, Daniel W. C., Li, Lulu
Format Journal Article
LanguageEnglish
Published New York IEEE 01.01.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0018-9286
1558-2523
2334-3303
1558-2523
DOI10.1109/TAC.2023.3264784

Cover

More Information
Summary:In this article, we study the distributed optimization problem (DOP) over the time-varying communication network topology with communication delays. The existing distributed optimization algorithms (DOAs) cannot be directly applied to DOPs over the time-varying network with communication delays. In this article, by adding new virtual agents and redefining communication links, some delay properties are realized and existing DOAs can then be reused to solve the DOPs. Thus, a generic algorithm framework is established, which can apply to many important DOAs, such as the mirror descent algorithm and dual averaging algorithm, to solve DOPs over the time-varying network with communication delays. The convergence results of the DOAs are established and verified under the generic algorithm framework.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
2334-3303
1558-2523
DOI:10.1109/TAC.2023.3264784