Distributed Computation of Linear Matrix Equations: An Optimization Perspective

From MaRDI portal
Publication:5223692

DOI10.1109/TAC.2018.2847603zbMATH Open1482.65068arXiv1708.01833OpenAlexW2963333577WikidataQ129699463 ScholiaQ129699463MaRDI QIDQ5223692FDOQ5223692


Authors: Xianlin Zeng, Shu Liang, Yiguang Hong, Jie Chen Edit this on Wikidata


Publication date: 18 July 2019

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Abstract: This paper investigates the distributed computation of the well-known linear matrix equation in the form of AXB=F, with the matrices A, B, X, and F of appropriate dimensions, over multi-agent networks from an optimization perspective. In this paper, we consider the standard distributed matrix-information structures, where each agent of the considered multi-agent network has access to one of the sub-block matrices of A, B, and F. To be specific, we first propose different decomposition methods to reformulate the matrix equations in standard structures as distributed constrained optimization problems by introducing substitutional variables; we show that the solutions of the reformulated distributed optimization problems are equivalent to least squares solutions to original matrix equations; and we design distributed continuous-time algorithms for the constrained optimization problems, even by using augmented matrices and a derivative feedback technique. Moreover, we prove the exponential convergence of the algorithms to a least squares solution to the matrix equation for any initial condition.


Full work available at URL: https://arxiv.org/abs/1708.01833







Cited In (25)





This page was built for publication: Distributed Computation of Linear Matrix Equations: An Optimization Perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223692)