The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Distributed Continuous-Time Optimization: Nonuniform Gradient Gains, Finite-Time Convergence, and Convex Constraint Set
Abstract
In this paper, a distributed optimization problem with general differentiable convex objective functions is studied for continuous-time multi-agent systems with single-integrator dynamics. The objective is for multiple agents to cooperatively optimize a team objective function formed by a sum of local objective functions with only local interaction and information while explicitly taking into account nonuniform gradient gains, finite-time convergence, and a common convex constraint set. First, a distributed nonsmooth algorithm is introduced for a special class of convex objective functions that have a quadratic-like form. It is shown that all agents reach a consensus in finite time while minimizing the team objective function asymptotically. Second, a distributed algorithm is presented for general differentiable convex objective functions, in which the interaction gains of each agent can be self-adjusted based on local states. A corresponding condition is then given to guarantee that all agents reach a consensus in finite time while minimizing the team objective function asymptotically. Third, a distributed optimization algorithm with state-dependent gradient gains is given for general differentiable convex objective functions. It is shown that the distributed continuous-time optimization problem can be solved even though the gradient gains are not identical. Fourth, a distributed tracking algorithm combined with a distributed estimation algorithm is given for general differentiable convex objective functions. It is shown that all agents reach a consensus while minimizing the team objective function in finite time. Fifth, as an extension of the previous results, a distributed constrained optimization algorithm with nonuniform gradient gains and a distributed constrained finite-time optimization algorithm are given. It is shown that both algorithms can be used to solve a distributed continuous-time optimization problem with a common convex constraint set. Numerical examples are included to illustrate the obtained theoretical 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
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
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
Finite-Dimensional Variational Inequalities and Complementarity Problems
(2004) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b97543 · Cited by 2,289
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 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
Finite-Time Consensus Problems for Networks of Dynamic Agents
Wang, L., & Xiao, F. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041610 · Cited by 1,170
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
Finite-time convergent gradient flows with applications to network consensus
Cortés, J. (2006) · Automatica · doi:10.1016/j.automatica.2006.06.015 · Cited by 818
Kia, S. S., Cortés, J., & Martínez, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.001 · Cited by 694
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
Distributed Asynchronous Constrained Stochastic Optimization
Srivastava, K., & Nedic, A. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2118740 · Cited by 350
Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded Derivatives
Chen, F., Cao, Y., & Ren, W. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2199176 · Cited by 320
Self-citationSubgradient methods and consensus algorithms for solving convex optimization problems
Johansson, B., Keviczky, T., Johansson, M., & Johansson, K. H. (2008) · 2008 47th IEEE Conference on Decision and Control · doi:10.1109/cdc.2008.4739339 · Cited by 316
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 constrained optimal consensus of multi-agent systems
Qiu, Z., Liu, S., & Xie, L. (2016) · Automatica · doi:10.1016/j.automatica.2016.01.055 · Cited by 261
Distributed multi-agent optimization subject to nonidentical constraints and communication delays
Lin, P., Ren, W., & Song, Y. (2016) · Automatica · doi:10.1016/j.automatica.2015.11.014 · Cited by 249
Self-citationAn Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
Zhu, M., & Martínez, S. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2228038 · Cited by 128
Gossip Algorithms for Convex Consensus Optimization Over Networks
Lu, J., Tang, C. Y., Regier, P. R., & Bow, T. D. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2160020 · Cited by 107
A distributed Newton method for Network Utility Maximization
Wei, E., Ozdaglar, A., & Jadbabaie, A. (2010) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5718026 · Cited by 106
Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals
Hendrickx, J. M., Shi, G., & Johansson, K. H. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2352691 · Cited by 70
A continuous-time decentralized optimization scheme with positivity constraints
Kvaternik, K., & Pavel, L. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6425817 · Cited by 41
Distributed optimization with the consideration of adaptivity and finite-time convergence
Lin, P., Ren, W., Song, Y., & Farrell, J. A. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6858932 · Cited by 35
Self-citation
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
Smart Clothing: Connecting Human with Clouds and Big Data for Sustainable Health Monitoring
Chen, M., Ma, Y., Song, J., Lai, C.-F., & Hu, B. (2016) · Mobile Networks and Applications · doi:10.1007/s11036-016-0745-1 · Cited by 443
Metadata
- Authors
- Lin, P., Ren, W., & Farrell, J. A.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2017-05
- Volume
- 62
- Issue
- 5
- Pages
- 2239-2253
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2517192452
- Cited by
- 403
- References
- 24
- FWCI
- 36.95
- 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.