Abstract

In this study, the authors consider distributed computation of the Stein equations with set constraints, where each agent or node knows a few rows or columns of coefficient matrices. By formulating an equivalent distributed optimisation problem, they propose a projection-based algorithm to seek least-squares solutions to the constrained Stein equation over a multi-agent system network. Then, they rigorously prove the convergence of the proposed algorithm to a least-squares solution for any initial condition, and moreover, provide a simplified distributed algorithm with an exponential convergence rate for the case without constraints.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.