A simple peer-to-peer algorithm for distributed optimization in sensor networks
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distributed optimization in sensor networks
Rabbat, M., & Nowak, R. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984626 · Cited by 901 · cited 3×
“A similar problem formulation for sensor network applications is considered by [7] and [8].”
Background
Cited by
Constrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086
Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2010) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9737-7 · Cited by 814
Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case
Lu, J., & Tang, C. Y. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2184199 · Cited by 403
A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
Johansson, B., Rabi, M., & Johansson, M. (2010) · SIAM Journal on Optimization · doi:10.1137/08073038x · Cited by 336
Self-citationAsynchronous Broadcast-Based Convex Optimization Over a Network
Nedic, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2079650 · Cited by 310
“Another asynchronous algorithm for optimization over networks is the Markov incremental algorithm proposed in [1], [2] and further studied in [8].”
MethodEvent-Triggered Feedback in Control, Estimation, and Optimization
Lemmon, M. (2010) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-0-85729-033-5_9 · Cited by 288
Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
Shi, G., Johansson, K. H., & Hong, Y. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2215261 · Cited by 288
Distributed Non-Autonomous Power Control through Distributed Convex Optimization
Ram, S. S., Veeravalli, V. V., & Nedic, A. (2009) · IEEE INFOCOM 2009 · doi:10.1109/infcom.2009.5062275 · Cited by 99
Lü, Q., & Li, H. (2016) · arXiv · doi:10.48550/arxiv.1611.00990 · Cited by 54
Metadata
- Authors
- Johansson, B., Rabi, M., & Johansson, M.
- Venue
- 2007 46th IEEE Conference on Decision and Control
- Publisher
- IEEE
- Published
- 2007
- Pages
- 4705-4710
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2160785244
- Cited by
- 90
- References
- 1
- FWCI
- 4.64
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.