Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 211

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

Distributed Adaptive Convex Optimization on Directed Graphs via Continuous-Time Algorithms

Open access
Li, Zhenhong, Ding, Zhengtao, Sun, Junyong, Li, Zhongkui·2018·IEEE Transactions on Automatic Control

Abstract

This note considers the distributed optimization problem on directed graphs with nonconvex local objective functions and the unknown network connectivity. A new adaptive algorithm is proposed to minimize a differentiable global objective function. By introducing dynamic coupling gains and updating the coupling gains using relative information of system states, the nonconvexity of local objective functions, unknown network connectivity, and the uncertain dynamics caused by locally Lipschitz gradients are tackled concurrently. Consequently, the global asymptotic convergence is established when the global objective function is strongly convex and the gradients of local objective functions are only locally Lipschitz. When the communication graph is strongly connected and weight-balanced, the algorithm is independent of any global information. Then, the algorithm is naturally extended to unbalanced directed graphs by using the left eigenvector of the Laplacian matrix associated with the zero eigenvalue. Several numerical simulations are presented to verify the results.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/tac.2017.2750103

Cites

3 of 3 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Show all 3 references

Cited by

See all 211

Metadata

Authors
Li, Z., Ding, Z., Sun, J., & Li, Z.
Venue
IEEE Transactions on Automatic Control
Published
2018-05
Volume
63
Issue
5
Pages
1434-1441
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
  • 2334-3303
OpenAlex
W2752175744
Cited by
211
References
3
FWCI
12.84
Type
journal article
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Distributed Adaptive Convex Optimization on Directed Graphs via Continuous-Time Algorithms. https://app.cochat.ai/papers/10.1109/tac.2017.2750103
The paper
Li, Z., Ding, Z., Sun, J., & Li, Z. (2018). Distributed Adaptive Convex Optimization on Directed Graphs via Continuous-Time Algorithms. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2017.2750103

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.