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

Full description

Bibliographic Details

Published in:	Systems & control letters Vol. 203; p. 106159
Main Authors:	Fang, Xianju, Zhang, Baoyong, Yuan, Deming, Liu, Honglei, Song, Bo
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!