Distributed Discrete-Time Convex Optimization With Closed Convex Set Constraints: Linearly Convergent Algorithm Design

The convergence rate and applicability to directed graphs with interaction topologies are two important features for practical applications of distributed optimization algorithms. In this article, a new kind of fast distributed discrete-time algorithms is developed for solving convex optimization pr...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on cybernetics Jg. 54; H. 4; S. 2271 - 2283
Hauptverfasser:	Luan, Meng, Wen, Guanghui, Liu, Hongzhe, Huang, Tingwen, Chen, Guanrong, Yu, Wenwu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 01.04.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Computational geometry Consensus Consensus algorithm Convergence Convex functions Convexity directed interaction topology distributed constrained optimization Eigenvalues and eigenfunctions gradient tracking Graph theory Graphs linear convergence rate Momentum Network topology Numerical simulation Optimization Topology
ISSN:	2168-2267, 2168-2275, 2168-2275
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!