The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Subgradient methods and consensus algorithms for solving convex optimization problems
Open accessAbstract
In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative procedure maintains local variables at each node and relies on local subgradient updates in combination with a consensus process. The local subgradient steps are applied simultaneously as opposed to the standard sequential or cyclic procedure. We study convergence properties of the proposed scheme using results from consensus theory and approximate subgradient methods. The framework is illustrated on an optimal distributed finite-time rendezvous problem.
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
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 3×
“This resembles to some extent agreement or consensus problems in multi-agent systems, which has a long history and has received renewed interest in the recent literature [9].”
BackgroundResultFast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
Kiwiel, K. C. (2004) · SIAM Journal on Optimization · doi:10.1137/s1052623400376366 · Cited by 182
Convergence Rates in Distributed Consensus and Averaging
Olshevsky, A., & Tsitsiklis, J. N. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2006.376899 · Cited by 153
Generalized consensus computation in networked systems with erasure links
Rabbat, M., Nowak, R. D., & Bucklew, J. A. (2005) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2005.1506308 · Cited by 126
On decentralized negotiation of optimal consensus
Johansson, B. J. E., Speranzon, A., Johansson, M., et al. (2007) · Automatica · doi:10.1016/j.automatica.2007.09.003 · Cited by 113
Self-citationMathematical decomposition techniques for distributed cross-layer optimization of data networks
Johansson, B., Soldati, P., & Johansson, M. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879364 · Cited by 106
Self-citationOn the rate of convergence of distributed subgradient methods for multi-agent optimization
Nedić, A. (2007) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2007.4434693 · Cited by 89
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
Self-citationOn 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
Sayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587
Sayed, A. H., Tu, S.-Y., Chen, J., Zhao, X., & Towfic, Z. J. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2231991 · Cited by 494
Tu, S.-Y., & Sayed, A. H. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2217338 · Cited by 467
Multi-Agent Distributed Optimization via Inexact Consensus ADMM
Chang, T.-H., Hong, M., & Wang, X. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2367458 · Cited by 444
Adaptation, Learning, and Optimization over Networks
Sayed, A. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601988515 · Cited by 415
Lin, P., Ren, W., & Farrell, J. A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2604324 · Cited by 403
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
Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
Chang, T.-H., Nedic, A., & Scaglione, A. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2308612 · Cited by 401
Distributed Alternating Direction Method of Multipliers
Wei, E., & Ozdaglar, A. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6425904 · Cited by 389
Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions
Rahili, S., & Ren, W. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2593899 · Cited by 343
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
Self-citationA Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays
Yang, T., Lu, J., Wu, D., Wu, J., Shi, G., Meng, Z., & Johansson, K. H. (2017) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2016.2617832 · Cited by 264
Self-citationDistributed Primal–Dual Subgradient Method for Multiagent Optimization via Consensus Algorithms
Yuan, D., Xu, S., & Zhao, H. (2011) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2160394 · Cited by 255
Lü, Q., & Li, H. (2016) · arXiv · doi:10.48550/arxiv.1611.00990 · Cited by 54
Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2014) · arXiv · doi:10.48550/arxiv.1406.2075 · Cited by 38
On the Linear Convergence of Distributed Optimization over Directed Graphs
Xi, C., & Khan, U. A. (2015) · arXiv · doi:10.48550/arxiv.1510.02149 · Cited by 29
Metadata
- Authors
- Johansson, B., Keviczky, T., Johansson, M., & Johansson, K. H.
- Venue
- 2008 47th IEEE Conference on Decision and Control
- Publisher
- IEEE
- Published
- 2008
- Pages
- 4185-4190
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2142184324
- Cited by
- 316
- References
- 12
- FWCI
- 10.31
- Type
- conference paper
- 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.