A Distributed Algorithm for Least Squares Solutions

In this technical note, a distributed algorithm is proposed for multiagent networks to achieve a least squares solution of a system of linear equations, in which each agent only knows part of the overall equations and communicates only with its nearby neighbors. The proposed algorithm is discrete ti...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on automatic control Ročník 64; číslo 10; s. 4217 - 4222
Hlavní autoři: Wang, Xuan, Zhou, Jingqiu, Mou, Shaoshuai, Corless, Martin J.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Computer simulation
Convergence
Distributed algorithms
Economic models
Kernel
Least squares
least squares solutions
Linear equations
Mathematical analysis
Mathematical model
multiagent networks
Multiagent systems
Nickel
Optimization
Symmetric matrices
ISSN:0018-9286, 1558-2523
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this technical note, a distributed algorithm is proposed for multiagent networks to achieve a least squares solution of a system of linear equations, in which each agent only knows part of the overall equations and communicates only with its nearby neighbors. The proposed algorithm is discrete time but does not involve small or time-varying step sizes. Given that the network is fixed, connected, and undirected, the proposed algorithm enables all agents in the network to achieve exponentially fast the same least squares solution; this is validated by simulations.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2019.2894588