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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on cybernetics Ročník 54; číslo 4; s. 2271 - 2283
Hlavní autori:	Luan, Meng, Wen, Guanghui, Liu, Hongzhe, Huang, Tingwen, Chen, Guanrong, Yu, Wenwu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.04.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!