The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
Open accessAbstract
Abstract In this paper, the distributed resource allocation optimization problem is investigated. The allocation decisions are made to minimize the sum of all the agents’ local objective functions while satisfying both the global network resource constraint and the local allocation feasibility constraints. Here the data corresponding to each agent in this separable optimization problem, such as the network resources, the local allocation feasibility constraint, and the local objective function, is only accessible to individual agent and cannot be shared with others, which renders new challenges in this distributed optimization problem. Based on either projection or differentiated projection, two classes of continuous-time algorithms are proposed to solve this distributed optimization problem in an initialization-free and scalable manner. Thus, no re-initialization is required even if the operation environment or network configuration is changed, making it possible to achieve a “plug-and-play” optimal operation of networked heterogeneous agents. The algorithm convergence is guaranteed for strictly convex objective functions, and the exponential convergence is proved for strongly convex functions without local constraints. Then the proposed algorithm is applied to the distributed economic dispatch problem in power grids, to demonstrate how it can achieve the global optimum in a scalable way, even when the generation cost, or system load, or network configuration, is changing.
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
Differential Inclusions: Set-Valued Maps and Viability Theory
Aubin, J.-P., & Cellina, A. (1984) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-69512-4 · Cited by 3,393
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 1×
“The following concepts of graph theory can be found in Mesbahi & Egerstedt (2010).”
BackgroundConstrained 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
Studies in Linear and Non-Linear Programming.
Beale, E. M. L., Arrow, K. J., Hurwicz, L., Uzawa, H., Chenery, H. B., Johnson, S. M., Karlin, S., Marschak, T., & Solow, R. M. (1959) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2342801 · Cited by 915
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
(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
(2013) · Encyclopedia of Systems Biology · doi:10.1007/978-1-4419-9863-7_101044 · Cited by 736
Kia, S. S., Cortés, J., & Martínez, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.001 · Cited by 694
Adaptation, Learning, and Optimization over Networks
Sayed, A. H. (2014) · Foundations and Trends in Machine Learning · doi:10.1561/2200000051 · Cited by 667
Projected Dynamical Systems and Variational Inequalities with Applications
Nagurney, A., & Zhang, D. (1996) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-2301-7 · Cited by 609
(2025) · Portfolio Optimization · doi:10.1017/9781009428095.021 · Cited by 553
Efficiency Loss in a Network Resource Allocation Game
Johari, R., & Tsitsiklis, J. N. (2004) · Mathematics of Operations Research · doi:10.1287/moor.1040.0091 · Cited by 537
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
Design and Stability of Load-Side Primary Frequency Control in Power Systems
Zhao, C., Topcu, U., Li, N., & Low, S. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2298140 · Cited by 466
Adaptation, Learning, and Optimization over Networks
Sayed, A. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601988515 · Cited by 415
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
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
Stability of primal–dual gradient dynamics and applications to network optimization
Feijer, D., & Paganini, F. (2010) · Automatica · doi:10.1016/j.automatica.2010.08.011 · Cited by 349
Optimal Scaling of a Gradient Method for Distributed Resource Allocation
Xiao, L., & Boyd, S. (2006) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-006-9080-1 · Cited by 326
Yi, P., Hong, Y., & Liu, F. (2015) · Systems & Control Letters · doi:10.1016/j.sysconle.2015.06.006 · Cited by 306
Self-citationReaching 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
Self-citationDistributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
Cherukuri, A., & Cortes, J. (2015) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2399191 · Cited by 286
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
Cherukuri, A., & Cortés, J. (2016) · Automatica · doi:10.1016/j.automatica.2016.07.003 · Cited by 256
Online Optimal Generation Control Based on Constrained Distributed Gradient Algorithm
Zhang, W., Liu, W., Wang, X., Liu, L., & Ferrese, F. T. (2014) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2319315 · Cited by 236
On the Stability of Globally Projected Dynamical Systems
Xia, Y. S., & Wang, J. (2000) · Journal of Optimization Theory and Applications · doi:10.1023/a:1004611224835 · Cited by 200
Asymptotic convergence of constrained primal–dual dynamics
Cherukuri, A., Mallada, E., & Cortés, J. (2016) · Systems & Control Letters · doi:10.1016/j.sysconle.2015.10.006 · Cited by 189
An $O(1/k)$ Gradient Method for Network Resource Allocation Problems
Beck, A., Nedić, A., Ozdaglar, A., & Teboulle, M. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2309751 · Cited by 186
Quantized Subgradient Algorithm and Data-Rate Analysis for Distributed Optimization
Yi, P., & Hong, Y. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2357513 · Cited by 169
Self-citationExponential stability of globally projected dynamic systems
Gao, X. (2003) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2003.809409 · Cited by 119
Apuzzo, M. D., Marino, M., Migdalas, A., Pardalos, P. M., & Toraldo, G. (2005) · Statistics, a series of textbooks and monographs · doi:10.1201/9781420028683.ch8 · Cited by 99
Multi-Step Gradient Methods for Networked Optimization
Ghadimi, E., Shames, I., & Johansson, M. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2278149 · Cited by 91
Lou, Y., Shi, G., Johansson, K. H., & Hong, Y. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2309261 · Cited by 89
Self-citationContinuous-time proportional-integral distributed optimisation for networked systems
Droge, G. N., Kawashima, H., & Egerstedt, M. (2014) · Journal of Control and Decision · doi:10.1080/23307706.2014.926622 · Cited by 72
Heal, G. (1973) · doi:10.1007/978-1-349-15492-0_21 · Cited by 70
Liao, L., Qi, H., & Qi, L. (2004) · Journal of Global Optimization · doi:10.1023/b:jogo.0000015310.27011.02 · Cited by 66
Cited by
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
Self-citationWang, X., & Chen, X. (2026) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2026.3684791
Metadata
- Authors
- Yi, P., Hong, Y., & Liu, F.
- Venue
- Automatica
- Publisher
- Elsevier BV
- Published
- 2016-12
- Volume
- 74
- Pages
- 259-269
- ISSN
- 0005-1098 (ISSN-L)
- OpenAlex
- W2273484141
- Cited by
- 478
- References
- 36
- FWCI
- 39.48
- 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.
