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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 68; no. 8; pp. 4767 - 4782
Main Authors:	Su, Yifan, Wang, Zhaojian, Cao, Ming, Jia, Mengshuo, Liu, Feng
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.08.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!