Convergence Analysis of Dual Decomposition Algorithm in Distributed Optimization: Asynchrony and Inexactness

Dual decomposition is widely utilized in the distributed optimization of multiagent systems. In practice, the dual decomposition algorithm is desired to admit an asynchronous implementation due to imperfect communication, such as time delay and packet drop. In addition, computational errors also exi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automatic control Jg. 68; H. 8; S. 4767 - 4782
Hauptverfasser: Su, Yifan, Wang, Zhaojian, Cao, Ming, Jia, Mengshuo, Liu, Feng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.08.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Asynchronous algorithm
Convergence
Decomposition
distributed optimization
dual decomposition
Heuristic algorithms
inexact algorithm
Linear programming
Multi-agent systems
multiagent system (MAS)
Multiagent systems
Newton method
Optimization
Power systems
Reagents
ISSN:0018-9286, 1558-2523
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Dual decomposition is widely utilized in the distributed optimization of multiagent systems. In practice, the dual decomposition algorithm is desired to admit an asynchronous implementation due to imperfect communication, such as time delay and packet drop. In addition, computational errors also exist when the individual agents solve their own subproblems. In this article, we analyze the convergence of the dual decomposition algorithm in the distributed optimization when both the communication asynchrony and the subproblem solution inexactness exist. We find that the interaction between asynchrony and inexactness slows down the convergence rate from <inline-formula><tex-math notation="LaTeX">\mathcal {O} (1 / k)</tex-math></inline-formula> to <inline-formula><tex-math notation="LaTeX">\mathcal {O} (1 / \sqrt{k})</tex-math></inline-formula>. Specifically, with a constant step size, the value of the objective function converges to a neighborhood of the optimal value, and the solution converges to a neighborhood of the optimal solution. Moreover, the violation of the constraints diminishes in <inline-formula><tex-math notation="LaTeX">\mathcal {O} (1 / \sqrt{k})</tex-math></inline-formula>. Our result generalizes and unifies the existing ones that only consider either asynchrony or inexactness. Finally, numerical simulations validate the theoretical results.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2022.3213608