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

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

Distributed Online Convex Optimization on Time-Varying Directed Graphs

Akbari, Mohammad, Gharesifard, Bahman, Linder, Tamas · 2017 · IEEE Transactions on Control of Network Systems

Abstract

This paper introduces a class of discrete-time distributed online optimization algorithms, with a group of agents whose communication topology is given by a uniformly strongly connected sequence of time-varying networks. At each time, a private locally Lipschitz strongly convex objective function is revealed to each agent. In the next time step, each agent updates its state using its own objective function and the information gathered from its immediate in-neighbors at that time. Under the assumption that the sequence of communication topologies is uniformly strongly connected, we design an algorithm, distributed over the sequence of time-varying topologies, which guarantees that the individual regret, the difference between the network cost incurred by the agent's states estimation and the cost incurred by the best fixed choice, grows only sublinearly. This algorithm consists of a subgradient flow along with a push-sum step to adjust for the directed nature of the network topologies. We implement the proposed algorithm in a collaborative localization problem, and the results show the proper performance of the algorithm.

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/tcns.2015.2505149

Cites

6 of 6 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

Show all 6 references

Cited by

See all 190

Metadata

Authors
Akbari, M., Gharesifard, B., & Linder, T.
Venue
IEEE Transactions on Control of Network Systems
Published
2017-09
Volume
4
Issue
3
Pages
417-428
ISSN
2325-5870 (ISSN-L)
OpenAlex
W2344279181
Cited by
190
References
6
FWCI
7.29
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: Distributed Online Convex Optimization on Time-Varying Directed Graphs. https://app.cochat.ai/papers/10.1109/tcns.2015.2505149
The paper
Akbari, M., Gharesifard, B., & Linder, T. (2017). Distributed Online Convex Optimization on Time-Varying Directed Graphs. IEEE Transactions on Control of Network Systems. https://doi.org/10.1109/tcns.2015.2505149

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.