Previous |  Up |  Next

Article

Title: A stochastic mirror-descent algorithm for solving $AXB=C$ over an multi-agent system (English)
Author: Wang, Yinghui
Author: Cheng, Songsong
Language: English
Journal: Kybernetika
ISSN: 0023-5954 (print)
ISSN: 1805-949X (online)
Volume: 57
Issue: 2
Year: 2021
Pages: 256-271
Summary lang: English
.
Category: math
.
Summary: 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. (English)
Keyword: distributed computation of matrix equation
Keyword: multi-agent system
Keyword: sublinear convergence
Keyword: stochastic mirror descent algorithm
MSC: 68M15
MSC: 93A14
idZBL: Zbl 07396266
idMR: MR4273575
DOI: 10.14736/kyb-2021-2-0256
.
Date available: 2021-07-30T13:06:38Z
Last updated: 2021-11-01
Stable URL: http://hdl.handle.net/10338.dmlcz/149038
.
Reference: [1] Bregman, L. M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming..USSR Computational Mathematics and Mathematical Physics 7 (1967), 200-217. MR 0215617,
Reference: [2] Chen, G., Zeng, X., Hong, Y.: Distributed optimisation design for solving the Stein equation with constraints..IET Control Theory Appl. 13 (2019), 2492-2499.
Reference: [3] Cheng, S., Liang, S.: Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate..Kybernetika 56 (2020), 559-577. MR 4131743,
Reference: [4] Deng, W., Zeng, X., Hong, Y.: Distributed computation for solving the Sylvester equation based on optimization..IEEE Control Systems Lett. 4 (2019), 414-419. MR 4211320,
Reference: [5] Gholami, M. R., Jansson, M., al., E. G. Ström et: Diffusion estimation over cooperative multi-agent networks with missing data..IEEE Trans. Signal Inform. Process. over Networks 2 (2016), 27-289. MR 3571397,
Reference: [6] Lan, G., Lee, S., Zhou, Y.: Communication-efficient algorithms for decentralized and stochastic optimization..Math. Programm. 180 (2020), 237-284. MR 4062837,
Reference: [7] Lei, J., Shanbhag, U. V., al., J. S. Pang et: On synchronous, asynchronous, and randomized best-response schemes for stochastic Nash games..Math. Oper. Res. 45 (2020), 157-190. MR 4066993,
Reference: [8] Liu, J., Morse, A. S., Nedic, A., a., et: Exponential convergence of a distributed algorithm for solving linear algebraic equations..Automatica 83 (2017), 37-46. MR 3680412,
Reference: [9] Mou, S., Liu, J., Morse, A. S.: A distributed algorithm for solving a linear algebraic equation..IEEE Trans. Automat. Control 60 (2015), 2863-2878. MR 3419577,
Reference: [10] Ram, S. S., Nedic, A., Veeravalli, V. V.: Distributed stochastic subgradient projection algorithms for convex optimization..J. Optim. Theory Appl. 147 (2010), 516-545. MR 2733992,
Reference: [11] Shi, G., Anderson, B. D. O., Helmke, U.: Network flows that solve linear equations..IEEE Trans. Automat. Control 62 (2016), 2659-2674. MR 3660554,
Reference: [12] Wang, Y., Lin, P., Hong, Y.: Distributed regression estimation with incomplete data in multi-agent networks..Science China Inform. Sci. 61 (2018), 092202. MR 3742944, 10.1007/s11432-016-9173-8
Reference: [13] Wang, Y., Lin, P., Qin, H.: Distributed classification learning based on nonlinear vector support machines for switching networks..Kybernetika 53 (2017), 595-611. MR 3730254,
Reference: [14] Wang, Y., Zhao, W., al., Y. Hong et: Distributed subgradient-free stochastic optimization algorithm for nonsmooth convex functions over time-varying networks..SIAM J. Control Optim. 57 (2019), 2821-2842. MR 3995027,
Reference: [15] Yuan, D., Hong, Y., al., D. W. C. Ho et: Optimal distributed stochastic mirror descent for strongly convex optimization..Automatica 90(2018), 196-203. MR 3764399,
Reference: [16] Yuan, D., Hong, Y., al., D. W. C. Ho et: Distributed mirror descent for online composite optimization..IEEE Trans. Automat. Control (2020). MR 4210454
Reference: [17] Zeng, X., Liang, S., al., Y. Hong et: Distributed computation of linear matrix equations: An optimization perspective..IEEE Trans. Automat. Control 64 (2018), 1858-1873. MR 3951032,
.

Files

Files Size Format View
Kybernetika_57-2021-2_4.pdf 754.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo