CoChat

Communication complexity of convex optimization

Open access
Tsitsiklis, John N, Luo, Zhi-Quan · 1987 · Journal of Complexity
Cited by 51

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/0885-064x(87)90013-6

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 51

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.