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

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

DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs

Xi, Chenguang, Khan, Usman A.·2017·IEEE Transactions on Automatic Control

Abstract

This paper develops a fast distributed algorithm, termed DEXTRA, to solve the optimization problem when n agents reach agreement and collaboratively minimize the sum of their local objective functions over the network, where the communication between the agents is described by a directed graph. Existing algorithms solve the problem restricted to directed graphs with convergence √ rates of O(ln k/ √k) for general convex objective functions and O(ln k/k) when the objective functions are strongly convex, where k is the number of iterations. We show that, with the appropriate step-size, DEXTRA converges at a linear rate O(τk) for 0 <; τ <; 1, given that the objective functions are restricted strongly convex. The implementation of DEXTRA requires each agent to know its local out-degree. Simulation examples further illustrate our 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.2017.2672698

Cites

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

Cited by

See all 172

Metadata

Authors
Xi, C., & Khan, U. A.
Venue
IEEE Transactions on Automatic Control
Published
2017-10
Volume
62
Issue
10
Pages
4980-4993
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W2590635385
Cited by
172
References
12
FWCI
14.86
Type
journal article
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

How to cite

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

This page
CoChat. (2026). Citation check: DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs. https://app.cochat.ai/papers/10.1109/tac.2017.2672698
The paper
Xi, C., & Khan, U. A. (2017). DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2017.2672698

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.