Communication complexity of convex optimization
Open accessThe DOI matches its Crossref record.
Abstract
We consider a situation where each one of two processors has access to a different convex function fi, i = 1, 2, defined on a common bounded domain. The processors are to exchange a number of binary messages, according to some protocol, until they find a point in the domain at which f1+f2 is minimized, within some prespecified accuracy ¿. Our objective is to determine protocols under which the number of exchanged messages is minimized.
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
Cited by
Harnessing Smoothness to Accelerate Distributed Optimization
Qu, G., & Li, N. (2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2698261 · Cited by 565
Linear Coherent Decentralized Estimation
Xiao, J.-J., Cui, S., Luo, Z.-Q., & Goldsmith, A. J. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.906762 · Cited by 277
Self-citationCommunication-efficient distributed learning: An overview
Cao, X., Başar, T., Diggavi, S., Eldar, Y. C., Letaief, K. B., Poor, H. V., & Zhang, J. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3242710 · Cited by 139
“It was shown in [83] that the minimal number of communication rounds to achieve this goal was Ω(d log(1/ε)), where d was the dimension of the decision variable (i.”
BackgroundCommunication Complexity of Distributed Convex Learning and Optimization
Arjevani, Y., & Shamir, O. (2015) · arXiv · doi:10.48550/arxiv.1506.01900 · Cited by 133
“Perhaps the most closely-related paper is [22], which studied the communication complexity of distributed optimization, and showed that Ω(d log(1/ )) bits of communication are necessary between the machines, for d-dimensional convex problems.”
BackgroundRobust and communication-efficient collaborative learning
Reisizadeh, A., Taheri, H., Mokhtari, A., Hassani, H., & Pedarsani, R. (2019) · arXiv · doi:10.48550/arxiv.1907.10595 · Cited by 73
Metadata
- Authors
- Tsitsiklis, J. N., & Luo, Z.-Q.
- Venue
- Journal of Complexity
- Publisher
- Elsevier BV
- Published
- 1987-09
- Volume
- 3
- Issue
- 3
- Pages
- 231-243
- ISSN
- 0885-064X (ISSN-L)
- OpenAlex
- W139031692
- Cited by
- 51
- References
- 0
- FWCI
- 0.47
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Communication complexity of convex optimization. https://app.cochat.ai/papers/10.1016/0885-064x(87)90013-6
- The paper
- Tsitsiklis, J. N., & Luo, Z.-Q. (1987). Communication complexity of convex optimization. Journal of Complexity. https://doi.org/10.1016/0885-064x(87)90013-6
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.