CoChat

Control approach to distributed optimization

Wang, Jing, Elia, Nicola · 2010 · 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Cited by 358

The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.

Abstract

In this paper, we propose a novel computation model for solving the distributed optimization problem where the objective function is formed by the sum of convex functions available to individual agent. Our approach differentiates from the existing approach by local convex mixing and gradient searching in that we force the states of the model to the global optimal point by controlling the subgradient of the global optimal function. In this way, the model we proposed does not suffer from the limitation of diminishing step size in gradient searching and allows fast asymptotic convergence. The model also shows robustness to additive noise, which is a main curse for algorithms based on convex mixing or consensus.

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.1109/allerton.2010.5706956

Cites

14 of 14 references verified0 citation errors · 0 not checkable

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

Cites

Cited by

See all 358

Metadata

Authors
Wang, J., & Elia, N.
Venue
2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Publisher
IEEE
Published
2010-09
Pages
557-561
OpenAlex
W2026509976
Cited by
358
References
14
FWCI
7.52
Type
conference paper
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.