The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
Open accessAbstract
This technical note studies the continuous-time distributed optimization of a sum of convex functions over directed graphs. Contrary to what is known in the consensus literature, where the same dynamics works for both undirected and directed scenarios, we show that the consensus-based dynamics that solves the continuous-time distributed optimization problem for undirected graphs fails to converge when transcribed to the directed setting. This study sets the basis for the design of an alternative distributed dynamics which we show is guaranteed to converge, on any strongly connected weight-balanced digraph, to the set of minimizers of a sum of convex differentiable functions with globally Lipschitz gradients. Our technical approach combines notions of invariance and cocoercivity with the positive definiteness properties of graph matrices to establish the results.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 2×
“ource localization, and robust estimation, and has been intensively studied in recent years, see e.g. [1], [2], [3], [4], [5], [6]. Most of these works build on consensusbased dynamics [7], [8], [9], [10] to design discrete-time algorithms that find the solution of the optimization problem. A recent exception are the w…”
BackgroundDistributed Consensus in Multi-vehicle Cooperative Control
Ren, W., & Beard, R. W. (2008) · Communications and Control Engineering · doi:10.1007/978-1-84800-015-5 · Cited by 2,826
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 asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Discontinuous dynamical systems
(2008) · IEEE Control Systems · doi:10.1109/mcs.2008.919306 · Cited by 1,068
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 1×
“a sum of convex functions has applications in a variety of scenarios, including sensor networks, source localization, and robust estimation, and has been intensively studied in recent years, see e.g. [1], [2], [3], [4], [5], [6]. Most of these works build on consensusbased dynamics [7], [8], [9], [10] to design discre…”
BackgroundOn Distributed Convex Optimization Under Inequality and Equality Constraints
Zhu, M., & Martinez, S. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2167817 · Cited by 759
Distributed Control of Robotic Networks
Bullo, F. (2009) · Cited by 649
Studies in Linear and Non-Linear Programming.
Suzuki, G., Arrow, K. J., Hurwicz, L., & Uzawa, H. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002823 · Cited by 520
A control perspective for centralized and distributed convex optimization
Wang, J., & Elia, N. (2011) · IEEE Conference on Decision and Control and European Control Conference · doi:10.1109/cdc.2011.6161503 · Cited by 398
Discontinuous Dynamical Systems: A tutorial on solutions, nonsmooth analysis, and stability
Cortés, J. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0901.3583 · Cited by 397
Stability and Stabilization of Discontinuous Systems and Nonsmooth Lyapunov Functions
Bacciotti, A., & Ceragioli, F. (1999) · ESAIM Control Optimisation and Calculus of Variations · doi:10.1051/cocv:1999113 · Cited by 384
Control approach to distributed optimization
Wang, J., & Elia, N. (2010) · 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2010.5706956 · Cited by 358
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
Event-triggered distributed optimization in sensor networks
Wan, P., & Lemmon, M. D. (2009) · ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) · doi:10.5555/1602165.1602172 · Cited by 108
A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
Bürger, M., Notarstefano, G., Bullo, F., & Allgöwer, F. (2012) · Automatica · doi:10.1016/j.automatica.2012.06.040 · Cited by 100
Modified Lagrangians and Monotone Maps in Optimization
Golʹshteĭn, E. G., & Tretʹi︠a︡kov, N. V. (1996) · Medical Entomology and Zoology · Cited by 93
Modified Lagrangians and monotone maps in optimization
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90271-0 · Cited by 76
Cited by
A 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
Kia, S. S., Cortés, J., & Martínez, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.001 · Cited by 694
Yi, P., Hong, Y., & Liu, F. (2016) · Automatica · doi:10.1016/j.automatica.2016.08.007 · Cited by 478
Lin, P., Ren, W., & Farrell, J. A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2604324 · Cited by 403
A Second-Order Multi-Agent Network for Bound-Constrained Distributed Optimization
Liu, Q., & Wang, J. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2416927 · Cited by 397
Metadata
- Authors
- Gharesifard, B., & Cortes, J.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2014-03
- Volume
- 59
- Issue
- 3
- Pages
- 781-786
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2164642931
- Cited by
- 833
- References
- 25
- FWCI
- 65.11
- Type
- journal article
- Language
- en
- Open access
- green
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.