Broadcast-based asynchronous convex optimization using quantized distributed stochastic mirror descent algorithm

We investigate a distributed convex optimization problem associated with a multi-agent network in this paper. Considering that there is no central coordinator in the network, each agent can only send information to its neighbors. For this case, a broadcast scheme based on asynchronous communication...

Celý popis

Podrobná bibliografie

Vydáno v:	Systems & control letters Ročník 203; s. 106159
Hlavní autoři:	Fang, Xianju, Zhang, Baoyong, Yuan, Deming, Liu, Honglei, Song, Bo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.09.2025
Témata:	Asynchronous algorithm Broadcast scheme Distributed convex optimization Mirror descent Quantized communication Mirror descent Distributed convex optimization Quantized communication Asynchronous algorithm Broadcast scheme
ISSN:	0167-6911
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!