A simple peer-to-peer algorithm for distributed optimization in sensor networks
2007 (English)In: PROCEEDINGS OF THE 46TH IEEE CONFERENCE ON DECISION AND CONTROL, 2007, 5402-5407 p.Conference paper (Refereed)
We propose a distributed algorithm that solves a special class of optimization problems using only peer-to-peer communication. One application is parameter estimation problems in sensor networks. Current decentralized algorithms for solving this class of optimization problems typically rely on passing around a parameter estimate in a ring consisting of all network nodes. In our algorithm, which extends the randomized incremental subgradient method with fixed stepsize due to Nedic and Bertsekas, nodes maintain individual estimates and need to exchange information only with their neighbors. We establish approach of the solution to an interval around the optimum value. We illustrate the algorithm's performance, in terms of convergence rate and communication cost relative to alternative schemes, through several numerical examples.
Place, publisher, year, edition, pages
2007. 5402-5407 p.
, IEEE conference on decision and control - proceedings, ISSN 0191-2216
IdentifiersURN: urn:nbn:se:kth:diva-26545DOI: 10.1109/CDC.2007.4434888ISI: 000255181703057ScopusID: 2-s2.0-62749197577OAI: oai:DiVA.org:kth-26545DiVA: diva2:385680
46th IEEE Conference on Decision and Control New Orleans, LA, DEC 12-14, 2007
QC 201101122011-01-122010-11-252011-01-12Bibliographically approved