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á bibliografie

Vydáno v:	Journal of the Franklin Institute Ročník 362; číslo 16; s. 107865
Hlavní autoři:	Liu, Shuai, Wang, Dong, Chen, Mingfei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 15.10.2025
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!