The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
Open accessAbstract
This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is a sum of local cost functions associated to the individual agents. We establish the exponential convergence of the proposed algorithm under (i) strongly connected and weight-balanced digraph topologies when the local costs are strongly convex with globally Lipschitz gradients, and (ii) connected graph topologies when the local costs are strongly convex with locally Lipschitz gradients. When the local cost functions are convex and the global cost function is strictly convex, we establish asymptotic convergence under connected graph topologies. We also characterize the algorithm's correctness under time-varying interaction topologies and study its privacy preservation properties. Motivated by practical considerations, we analyze the algorithm implementation with discrete-time communication. We provide an upper bound on the stepsize that guarantees exponential convergence over connected graphs for implementations with periodic communication. Building on this result, we design a provably-correct centralized event-triggered communication scheme that is free of Zeno behavior. Finally, we develop a distributed, asynchronous event-triggered communication scheme that is also free of Zeno with asymptotic convergence guarantees. Several simulations illustrate our results.
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
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
Distributed event-triggered control for multi-agent systems
Dimarogonas, D. V., Frazzoli, E., & Johansson, K. H. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2174666 · Cited by 2,556
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
An introduction to event-triggered and self-triggered control
Heemels, W. P. M. H., Johansson, K. H., & Tabuada, P. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6425820 · Cited by 1,940
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
Self-citationEvent-Triggering in Distributed Networked Control Systems
Wang, X., & Lemmon, M. D. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2057951 · Cited by 1,171
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2161027 · Cited by 947
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2010) · Cited by 884
Donkers, M. C. F., & Heemels, W. P. M. H. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2174696 · Cited by 846
Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
Gharesifard, B., & Cortes, J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2278132 · Cited by 833
On 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
Decentralized Event-Triggered Control Over Wireless Sensor/Actuator Networks
Mazo, M., & Tabuada, P. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2164036 · Cited by 691
Decentralized estimation and control of graph connectivity for mobile sensor networks
Yang, P., Freeman, R. A., Gordon, G. J., Lynch, K. M., Srinivasa, S. S., & Sukthankar, R. (2010) · Automatica · doi:10.1016/j.automatica.2009.11.012 · Cited by 430
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 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
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
Distributed algorithms for maximum lifetime routing in wireless sensor networks
Madan, R., & Lall, S. (2006) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2006.1687734 · Cited by 357
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
Eigenvalues, diameter, and mean distance in graphs
Mohar, B. (1991) · Graphs and Combinatorics · doi:10.1007/bf01789463 · Cited by 301
Distributed event-triggered coordination for average consensus on weight-balanced digraphs
Nowzari, C., & Cortés, J. (2016) · Automatica · doi:10.1016/j.automatica.2016.01.069 · Cited by 275
Self-citationDistributed Autonomous Online Learning: Regrets and Intrinsic Privacy-Preserving Properties
Yan, F., Sundaram, S., Vishwanathan, S. V. N., & Qi, Y. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.191 · Cited by 263
Decentralised event-triggered cooperative control with limited communication
Garcia, E., Cao, Y., Yu, H., Antsaklis, P., & Casbeer, D. (2013) · International Journal of Control · doi:10.1080/00207179.2013.787647 · Cited by 228
Distributed control of robotic networks
Pappas, G. J., & Zavlanos, M. M. (2008) · Cited by 140
Zhang, Z., Ying, X., & Chow, M. (2011) · North American Power Symposium (NAPS) · doi:10.1109/naps.2011.6025103 · Cited by 121
Distributed and Recursive Parameter Estimation in Parametrized Linear State-Space Models
Ram, S. S., Veeravalli, V. V., & Nedić, A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2037460 · Cited by 119
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
Newton-Raphson consensus for distributed convex optimization
Zanella, F., Varagnolo, D., Cenedese, A., Pillonetto, G., & Schenato, L. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6160605 · Cited by 98
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
Event-triggered communication and control of networked systems for multi-agent consensus
Nowzari, C., Garcia, E., & Cortés, J. (2019) · Automatica · doi:10.1016/j.automatica.2019.03.009 · Cited by 655
Self-citationYi, 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
Distributed Nash equilibrium seeking for aggregative games with coupled constraints
Liang, S., Yi, P., & Hong, Y. (2017) · Automatica · doi:10.1016/j.automatica.2017.07.064 · Cited by 328
Metadata
- Authors
- Kia, S. S., Cortés, J., & Martínez, S.
- Venue
- Automatica
- Publisher
- Elsevier BV
- Published
- 2015-05
- Volume
- 55
- Pages
- 254-264
- ISSN
- 0005-1098 (ISSN-L)
- OpenAlex
- W2057929279
- Cited by
- 694
- References
- 29
- FWCI
- 64.08
- 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.
