On Distributed Convex Optimization Under Inequality and Equality Constraints
The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Abstract
We consider a general multi-agent convex optimization problem where the agents are to collectively minimize a global objective function subject to a global inequality constraint, a global equality constraint, and a global constraint set. The objective function is defined by a sum of local objective functions, while the global constraint set is produced by the intersection of local constraint sets. In particular, we study two cases: one where the equality constraint is absent, and the other where the local constraint sets are identical. We devise two distributed primal-dual subgradient algorithms based on the characterization of the primal-dual optimal solutions as the saddle points of the Lagrangian and penalty functions. These algorithms can be implemented over networks with dynamically changing topologies but satisfying a standard connectivity property, and allow the agents to asymptotically agree on optimal solutions and optimal values of the optimization problem under the Slater's condition.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
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 · cited 2×
“Another related paper is [8] where a special case of [17], the network topology is fixed and all the local constraint sets are identical, is addressed.”
BackgroundCoordination 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
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
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
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 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
Stability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
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
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
Kashyap, A., Başar, T., & Srikant, R. (2007) · Automatica · doi:10.1016/j.automatica.2007.01.002 · Cited by 749
Convergence Speed in Distributed Consensus and Averaging
Olshevsky, A., & Tsitsiklis, J. N. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/060678324 · Cited by 692
(2025) · Portfolio Optimization · doi:10.1017/9781009428095.021 · Cited by 553
Discrete-time dynamic average consensus
Zhu, M., & Martínez, S. (2010) · Automatica · doi:10.1016/j.automatica.2009.10.021 · Cited by 488
Self-citationDistributed algorithms for reaching consensus on general functions
Cortés, J. (2008) · Automatica · doi:10.1016/j.automatica.2007.07.022 · Cited by 469
Subgradient Methods for Saddle-Point Problems
Nedić, A., & Ozdaglar, A. (2009) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-009-9522-7 · Cited by 438
A Necessary and Sufficient Condition for Consensus Over Random Networks
Tahbaz-Salehi, A., & Jadbabaie, A. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.917743 · Cited by 431
Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
Nedić, A., & Ozdaglar, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070708111 · Cited by 399
An interior point nonlinear programming for optimal power flow problems with a novel data structure
Wei, H., Sasaki, H., Kubokawa, J., & Yokoyama, R. (1998) · IEEE Transactions on Power Systems · doi:10.1109/59.708745 · Cited by 383
Studies in Linear and Nonlinear Programming
Kunzi, H. P., Arrow, J. K., Hurwicz, L., & Uzawa, H. (1963) · Econometrica · doi:10.2307/1910003 · Cited by 337
Pardalos, P. M. (2010) · Optimization Methods and Software · doi:10.1080/10556781003625177 · Cited by 328
Decentralized Control of Connectivity for Multi-Agent Systems
De Gennaro, M. C., & Jadbabaie, A. (2006) · Proceedings of the 45th IEEE Conference on Decision and Control · doi:10.1109/cdc.2006.377041 · Cited by 322
Subgradient 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
Distributed EM algorithms for density estimation and clustering in sensor networks
Nowak, R. D. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.814623 · Cited by 256
Decentralized source localization and tracking
Rabbat, M., & Nowak, R. D. (2004) · Minds at UW (University of Wisconsin) · Cited by 142
Asynchronous Distributed Averaging on Communication Networks
Mehyar, M., Spanos, D. P., Pongsajapan, J., Low, S. H., & Murray, R. M. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.893226 · Cited by 123
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
Convex Optimization Strategies for Coordinating Large-Scale Robot Formations
Derenick, J. C., & Spletzer, J. R. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.909833 · Cited by 113
Optimal active power dispatch combining network flow and interior point approaches
de Oliveira, A. R. L., Soares, S., & Nepomuceno, L. M. (2003) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2003.814851 · Cited by 81
Consensus over random networks
Tahbaz-Salehi, A., & Jadbabaie, A. (2006) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 78
Zhu, M., & Martı́nez, S. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1001.2612 · Cited by 45
Self-citationUsing Game Theory for Distributed Control Engineering
Rantzer, A. (2008) · Lund University Publications (Lund University) · Cited by 37
Distributed averaging on digital erasure networks
Carli, R., Como, G., Frasca, P., & Garin, F. (2010) · Automatica · doi:10.1016/j.automatica.2010.10.015 · Cited by 25
Optimization of Multi-agent Motion Programs with Applications to Robotic Marionettes
Martin, P., & Egerstedt, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00602-9_19 · Cited by 7
Cited by
EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069
“Other works on distributed algorithms that also require the use of diminishing step-sizes include [19, 40, 78].”
BackgroundA 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
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
Kia, S. S., Cortés, J., & Martínez, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.001 · Cited by 694
Metadata
- Authors
- Zhu, M., & Martinez, S.
- Affiliations
- University of California San Diego (US)
- ORCID
- Minghui Zhu
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2012-01
- Volume
- 57
- Issue
- 1
- Pages
- 151-164
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2022948311
- Cited by
- 759
- References
- 36
- Citations by year
- 2026: 13 · 2025: 38 · 2024: 33 · 2023: 44 · 2022: 46 · 2021: 62 · 2020: 78 · 2019: 74 · 2018: 74 · 2017: 81 · 2016: 82 · 2015: 60 · 2014: 32 · 2013: 23 · 2012: 17
- FWCI
- 30.95
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Automatic Control (publishedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
- Keywords
- distributed convex optimization, multi-agent systems, inequality constraints, equality constraints, saddle points, Lagrangian, penalty method, Slater's condition
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.