CoChat

Distributed optimization over time-varying directed graphs

Nedic, Angelia, Olshevsky, Alex · 2013 · 52nd IEEE Conference on Decision and Control

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

Abstract

We consider distributed optimization by a collection of nodes, each having access to its own convex function, whose collective goal is to minimize the sum of the functions. The communications between nodes are described by a time-varying sequence of directed graphs, which is uniformly strongly connected. For such communications, assuming that every node knows its out-degree, we develop a broadcast-based algorithm, termed the subgradient-push, which steers every node to an optimal value under a standard assumption of subgradient boundedness. The subgradient-push requires no knowledge of either the number of agents or the graph sequence to implement. Our analysis shows that the subgradient-push algorithm converges at a rate of O (ln t/√t), where the constant depends on the initial values at the nodes, the subgradient norms, and, more interestingly, on both the consensus speed and the imbalances of influence among the nodes.

Overview

Integrity signals

Registry

Crossref · 10.1109/cdc.2013.6760975

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Research works printed but not linked: 1

  1. gharesifard, 2012, Distributed Continuoustime Convex Optimization on Weight-balanced Digraphs

Cited by

See all 72

Metadata

Authors
Nedic, A., & Olshevsky, A.
Affiliations
University of Illinois Urbana-Champaign (US)
Venue
52nd IEEE Conference on Decision and Control
Publisher
IEEE
Published
2013-12
Pages
6855-6860
ISSN
0191-2216 (ISSN-L)
OpenAlex
W2952931788
Cited by
72
References
31
Citations by year
2026: 4 · 2024: 2 · 2023: 3 · 2021: 10 · 2020: 8 · 2019: 2 · 2018: 4 · 2017: 7 · 2016: 7 · 2015: 14 · 2014: 10 · 2013: 1
FWCI
8.17
Type
conference paper
Language
en
Open access
closed
Locations
IEEE Conference on Decision and Control (CDC) (publishedVersion)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
  • Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
Keywords
distributed optimization, time-varying directed graphs, convex optimization, consensus, convergence rate

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.