The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Distributed Asynchronous Constrained Stochastic Optimization
Abstract
In this paper, we study two problems which often occur in various applications arising in wireless sensor networks. These are the problem of reaching an agreement on the value of local variables in a network of computational agents and the problem of cooperative solution to a convex optimization problem, where the objective function is the aggregate sum of local convex objective functions. We incorporate the presence of a random communication graph between the agents in our model as a more realistic abstraction of the gossip and broadcast communication protocols of a wireless network. An added ingredient is the presence of local constraint sets to which the local variables of each agent is constrained. Our model allows for the objective functions to be nondifferentiable and accommodates the presence of noisy communication links and subgradient errors. For the consensus problem we provide a diminishing step size algorithm which guarantees asymptotic convergence. The distributed optimization algorithm uses two diminishing step size sequences to account for communication noise and subgradient errors. We establish conditions on these step sizes under which we can achieve the dual task of reaching consensus and convergence to the optimal set with probability one. In both cases we consider the constant step size behavior of the algorithm and establish asymptotic error bounds.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Markov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
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
Self-citationOptimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Stochastic Approximation and Recursive Algorithms and Applications
(2003) · Stochastic Modelling and Applied Probability · doi:10.1007/b97441 · Cited by 1,838
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
Markov Chains and Stochastic Stability
Meyn, S., Tweedie, R. L., & Glynn, P. W. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626630 · Cited by 1,680
Dudley, R. M. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511755347 · Cited by 1,281
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
Distributed average consensus with least-mean-square deviation
Xiao, L., Boyd, S., & Kim, S.-J. (2007) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2006.08.010 · Cited by 1,107
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
The Mathematics of Internet Congestion Control
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841398 · Cited by 821
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
Self-citationThe Mathematics of Internet Congestion Control
Srikant, R. (2004) · Systems & Control: Foundations & Applications · doi:10.1007/978-0-8176-8216-3 · Cited by 800
Kashyap, A., Başar, T., & Srikant, R. (2007) · Automatica · doi:10.1016/j.automatica.2007.01.002 · Cited by 749
The method of projections for finding the common point of convex sets
Gubin, L. G., Polyak, B. T., & Raik, E. V. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90113-9 · Cited by 729
Kar, S., & Moura, J. M. F. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007111 · Cited by 691
The Elements of Statistical Learning
Sapatinas, T. (2004) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2004.298_11.x · Cited by 635
Numerical Techniques for Stochastic Optimization
(1988) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-61370-8 · Cited by 632
Incremental Subgradient Methods for Nondifferentiable Optimization
Nedic, A., & Bertsekas, D. P. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623499362111 · Cited by 589
Self-citationDual Averaging Method for Regularized Stochastic Learning and Online Optimization
Xiao, L. (2009) · Cited by 574
Broadcast Gossip Algorithms for Consensus
Aysal, T. C., Yildiz, M. E., Sarwate, A. D., & Scaglione, A. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016247 · Cited by 480
On Exponential Synchronization of Kuramoto Oscillators
Chopra, N., & Spong, M. W. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2007884 · Cited by 422
Distributed Subgradient Methods for Convex Optimization Over Random Networks
Lobel, I., & Ozdaglar, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2091295 · Cited by 351
Randomized consensus algorithms over large scale networks
Fagnani, F., & Zampieri, S. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080506 · Cited by 350
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
Asynchronous Broadcast-Based Convex Optimization Over a Network
Nedic, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2079650 · Cited by 310
stochastic quasigradient methods and their application to system optimization†
Ermoliev, Y. (1983) · Stochastics · doi:10.1080/17442508308833246 · Cited by 280
Convergence and asymptotic agreement in distributed decision problems
Tsitsiklis, J., & Athans, M. (1984) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1984.1103385 · Cited by 247
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
Xiaolin (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1953017 · Cited by 233
Stochastic Programming Methods
Ermoliev, Y. M. (1976) · IIASA PURE (International Institute of Applied Systems Analysis) · Cited by 147
A Collaborative Training Algorithm for Distributed Learning
Predd, J. B., Kulkarni, S. R., & Poor, H. V. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2012992 · Cited by 145
Matei, I., & Baras, J. S. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2120593 · Cited by 133
Consensus Based Overlapping Decentralized Estimator
Stanković, S. S., Stanković, M. S., & Stipanović, D. M. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009583 · Cited by 127
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
Self-citationOn Distributed Optimization in Networked Systems
Johansson, B. (2008) · Cited by 97
Asynchronous gossip algorithms for stochastic optimization
Ram, S. S., Nedić, A., & Veeravalli, V. V. (2009) · International Conference on Game Theory for Networks · doi:10.1109/gamenets.2009.5137386 · Cited by 94
Stochastic approximation for consensus seeking: Mean square and almost sure convergence
Huang, M., & Manton, J. H. (2007) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2007.4434630 · Cited by 79
Asynchronous gossip algorithms for stochastic optimization
Ram, S. S., Nedić, A., & Veeravalli, V. V. (2009) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2009.5399485 · Cited by 65
Distributed consensus over network with noisy links
Touri, B. (2015) · Cited by 36
Kar, S., Moura, J. M. F., & Ramanan, K. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.0009 · Cited by 32
Fully Distributed Algorithms for Convex Optimization Problems
Mosk-Aoyama, D., Roughgarden, T., & Shah, D. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-75142-7_41 · Cited by 19
Asynchronous stochastic convex optimization over random networks: Error bounds
Touri, B., Nedić, A., & Ram, S. S. (2010) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2010.5454103 · Cited by 18
Cited by
Distributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187
Self-citationA survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks
Chen, J., & Sayed, A. H. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2198470 · Cited by 680
Fast Distributed Gradient Methods
Jakovetic, D., Xavier, J., & Moura, J. M. F. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2298712 · Cited by 624
Sayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587
Metadata
- Authors
- Srivastava, K., & Nedic, A.
- Venue
- IEEE Journal of Selected Topics in Signal Processing
- Published
- 2011-08
- Volume
- 5
- Issue
- 4
- Pages
- 772-790
- ISSN
- 1932-4553 (ISSN-L)
- 1941-0484
- OpenAlex
- W2162594647
- Cited by
- 350
- References
- 47
- FWCI
- 31.64
- Type
- journal article
- 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.