A distributed optimization algorithm with guaranteed optimality subject to lossy information-sharing over directed networks

This paper addresses the distributed optimization problem subject to lossy information-sharing. In the setting, each agent is assumed to have an individual cost function that is strongly convex and smooth. The goal of agents is to cooperatively minimize the sum of the local cost functions associated...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of the Franklin Institute Ročník 362; číslo 16; s. 107865
Hlavní autori:	Liu, Shuai, Wang, Dong, Chen, Mingfei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 15.10.2025
Predmet:	Distributed algorithm Linear convergence rate Lossy information-sharing Uncoordinated step sizes Linear convergence rate Uncoordinated step sizes Lossy information-sharing Distributed algorithm
ISSN:	0016-0032
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!