A stochastic mirror-descent algorithm for solving AXB=C over an multi-agent system
DOI10.14736/KYB-2021-2-0256OpenAlexW3164161876MaRDI QIDQ4959620FDOQ4959620
Authors: Yinghui Wang, Songsong Cheng 
Publication date: 16 September 2021
Published in: Kybernetika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.14736/kyb-2021-2-0256
Recommendations
- Distributed algorithms of solving linear matrix equations via double-layered networks
- Distributed optimisation approach to least-squares solution of Sylvester equations
- A distributed algorithm for efficiently solving linear equations and its applications (special issue JCW)
- Computation of linear algebraic equations with solvability verification over multi-agent networks.
multi-agent systemsublinear convergencedistributed computation of matrix equationstochastic mirror descent algorithm
Reliability, testing and fault tolerance of networks and computer systems (68M15) Decentralized systems (93A14)
This page was built for publication: A stochastic mirror-descent algorithm for solving AXB=C over an multi-agent system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959620)
