A stochastic mirror-descent algorithm for solving $AXB=C$ over an multi-agent system
Kybernetika, Tome 57 (2021) no. 2, pp. 256-271
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
In this paper, we consider a distributed stochastic computation of $AXB=C$ with local set constraints over an multi-agent system, where each agent over the network only knows a few rows or columns of matrixes. Through formulating an equivalent distributed optimization problem for seeking least-squares solutions of $AXB=C$, we propose a distributed stochastic mirror-descent algorithm for solving the equivalent distributed problem. Then, we provide the sublinear convergence of the proposed algorithm. Moreover, a numerical example is also given to illustrate the effectiveness of the proposed algorithm.
DOI :
10.14736/kyb-2021-2-0256
Classification :
68M15, 93A14
Keywords: distributed computation of matrix equation; multi-agent system; sublinear convergence; stochastic mirror descent algorithm
Keywords: distributed computation of matrix equation; multi-agent system; sublinear convergence; stochastic mirror descent algorithm
@article{10_14736_kyb_2021_2_0256,
author = {Wang, Yinghui and Cheng, Songsong},
title = {A stochastic mirror-descent algorithm for solving $AXB=C$ over an multi-agent system},
journal = {Kybernetika},
pages = {256--271},
publisher = {mathdoc},
volume = {57},
number = {2},
year = {2021},
doi = {10.14736/kyb-2021-2-0256},
mrnumber = {4273575},
zbl = {07396266},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2021-2-0256/}
}
TY - JOUR AU - Wang, Yinghui AU - Cheng, Songsong TI - A stochastic mirror-descent algorithm for solving $AXB=C$ over an multi-agent system JO - Kybernetika PY - 2021 SP - 256 EP - 271 VL - 57 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2021-2-0256/ DO - 10.14736/kyb-2021-2-0256 LA - en ID - 10_14736_kyb_2021_2_0256 ER -
%0 Journal Article %A Wang, Yinghui %A Cheng, Songsong %T A stochastic mirror-descent algorithm for solving $AXB=C$ over an multi-agent system %J Kybernetika %D 2021 %P 256-271 %V 57 %N 2 %I mathdoc %U http://geodesic.mathdoc.fr/articles/10.14736/kyb-2021-2-0256/ %R 10.14736/kyb-2021-2-0256 %G en %F 10_14736_kyb_2021_2_0256
Wang, Yinghui; Cheng, Songsong. A stochastic mirror-descent algorithm for solving $AXB=C$ over an multi-agent system. Kybernetika, Tome 57 (2021) no. 2, pp. 256-271. doi: 10.14736/kyb-2021-2-0256
Cité par Sources :