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

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

Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices

Open access
Xi, Chenguang, Mai, Van Sy, Xin, Ran, Abed, Eyad H., Khan, Usman A.·2018·IEEE Transactions on Automatic Control

Abstract

This paper considers a distributed optimization problem over a multiagent network, in which the objective function is a sum of individual cost functions at the agents. We focus on the case when communication between the agents is described by a directed graph. Existing distributed optimization algorithms for directed graphs require at least the knowledge of the neighbors' outdegree at each agent (due to the requirement of column-stochastic matrices). In contrast, our algorithm requires no such knowledge. Moreover, the proposed algorithm achieves the best known rate of convergence for this class of problems, O(μk) for 0 <; μ <; 1, where k is the number of iterations, given that the objective functions are strongly convex and have Lipschitz-continuous gradients. Numerical experiments are also provided to illustrate the theoretical findings.

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

Cites

10 of 10 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 10 references

Cited by

See all 215

Metadata

Authors
Xi, C., Mai, V. S., Xin, R., Abed, E. H., & Khan, U. A.
Venue
IEEE Transactions on Automatic Control
Published
2018-10
Volume
63
Issue
10
Pages
3558-3565
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
  • 2334-3303
OpenAlex
W2964103300
Cited by
215
References
10
FWCI
15.09
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: Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices. https://app.cochat.ai/papers/10.1109/tac.2018.2797164
The paper
Xi, C., Mai, V. S., Xin, R., Abed, E. H., & Khan, U. A. (2018). Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2018.2797164

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.