Distributed Least Square with intermittent communications

Jing Wang, Nicola Elia

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Scopus citations

Abstract

In this paper, we present a distributed algorithm to solve unconstrained distributed Least Squares optimization problems over networks where the communication links could stochastically break. The iterative algorithm allows each node with limited computation and communication capabilities to obtain the optimal solution of the centralized problem. We provide the convergence analysis of the algorithm based on an internal structure decomposition and an application of stochastic systems theory. The results suggests that agents with simple dynamics, one step memory and local gradient information could collectively solve complicated optimization problems in the presence of unreliable communications.

Original languageEnglish (US)
Title of host publication2012 American Control Conference, ACC 2012
Pages6479-6484
Number of pages6
StatePublished - Nov 26 2012
Externally publishedYes
Event2012 American Control Conference, ACC 2012 - Montreal, QC, Canada
Duration: Jun 27 2012Jun 29 2012

Other

Other2012 American Control Conference, ACC 2012
CountryCanada
CityMontreal, QC
Period6/27/126/29/12

Fingerprint Dive into the research topics of 'Distributed Least Square with intermittent communications'. Together they form a unique fingerprint.

Cite this