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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Systems & control letters Jg. 203; S. 106159
Hauptverfasser:	Fang, Xianju, Zhang, Baoyong, Yuan, Deming, Liu, Honglei, Song, Bo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.09.2025
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!