Optimal Scaling of a Gradient Method for Distributed Resource Allocation
The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
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
Self-citationEquation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
(2013) · American Economic Review · doi:10.1257/aer.103.2.i · Cited by 8,218
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Self-citationFast 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
Self-citationWeik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
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
Laplacian matrices of graphs: a survey
Merris, R. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90486-3 · Cited by 1,520
Parallel and distributed computation
Bertsekas, D. P., Tsitsiklis, J. N., & Sennikov, A. N. (1989) · Cited by 1,187
Network Optimization: Continuous and Discrete Models
Bertsekas, D. P. (1998) · Cited by 1,027
Interior Point Algorithms: Theory and Analysis
Ye, Y. (1997) · Wiley eBooks · doi:10.1002/9781118032701 · Cited by 939
Fastest Mixing Markov Chain on a Graph
Boyd, S., Diaconis, P., & Xiao, L. (2004) · SIAM Review · doi:10.1137/s0036144503423264 · Cited by 744
Self-citationThe Design of Mechanisms for Resource Allocation
(2022) · The Collected Papers of Leonid Hurwicz · doi:10.1093/oso/9780199313280.003.0009 · Cited by 593
Handbook of semidefinite programming : theory, algorithms, and applications
Wolkowicz, H., Saigal, R., & Vandenberghe, L. (2000) · Cited by 568
A microeconomic approach to optimal resource allocation in distributed computer systems
Kurose, J. F., & Simha, R. (1989) · IEEE Transactions on Computers · doi:10.1109/12.24272 · Cited by 276
What Do We Know about the Metropolis Algorithm ?
Diaconis, P. W., & Saloff‐Coste, L. (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1576 · Cited by 142
Distributed asynchronous optimal routing in data networks
Tsitsiklis, J. N., & Bertsekas, D. P. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104261 · Cited by 140
Heal, G. (1973) · doi:10.1007/978-1-349-15492-0_21 · Cited by 70
Cited by
Yi, P., Hong, Y., & Liu, F. (2016) · Automatica · doi:10.1016/j.automatica.2016.08.007 · Cited by 478
Distributed Optimization for Control
Nedić, A., & Liu, J. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105131 · Cited by 302
Distributed 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 Optimization Under Adversarial Nodes
Sundaram, S., & Gharesifard, B. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2836919 · Cited by 274
A Distributed Economic Dispatch Strategy for Power–Water Networks
Li, P., Hu, J., Qiu, L., Zhao, Y., & Ghosh, B. K. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3104103 · Cited by 267
Metadata
- Authors
- Xiao, L., & Boyd, S.
- Venue
- Journal of Optimization Theory and Applications
- Published
- 2006-11-29
- Volume
- 129
- Issue
- 3
- Pages
- 469-488
- ISSN
- 0022-3239 (ISSN-L)
- 1573-2878
- OpenAlex
- W2114085163
- Cited by
- 326
- References
- 23
- FWCI
- 5.13
- 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.