CoChat

Continuous-time distributed convex optimization on weight-balanced digraphs

Gharesifard, Bahman, Cortes, Jorge · 2012 · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC)

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

Abstract

This paper studies the continuous-time distributed optimization of a sum of convex functions over directed graphs. Contrary to what is known in the consensus literature, where the same dynamics works for both undirected and directed scenarios, we show that the consensus-based dynamics that solves the continuous-time distributed optimization problem for undirected graphs fails to converge when transcribed to the directed setting. This study sets the basis for the design of an alternative distributed dynamics which we show is guaranteed to converge, on any strongly connected weight-balanced digraph, to the set of minimizers of a sum of convex differentiable functions with globally Lipschitz gradients. Our technical approach combines notions of invariance and cocoercivity with the positive definiteness properties of graph matrices to establish the results.

Overview

Integrity signals

Registry

Crossref · 10.1109/cdc.2012.6426897

Cites

21 of 21 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: 2

  1. khalil, 2002, Nonlinear Systems
  2. rockafellar, 1997, Convex Analysis

Cited by

See all 32

Metadata

Authors
Gharesifard, B., & Cortes, J.
Affiliations
University of California San Diego (US)
Venue
2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
Publisher
IEEE
Published
2012-12
Pages
7451-7456
ISSN
0191-2216 (ISSN-L)
OpenAlex
W1979062758
Cited by
32
References
21
Citations by year
2024: 1 · 2023: 1 · 2022: 1 · 2021: 4 · 2020: 1 · 2019: 1 · 2018: 3 · 2017: 3 · 2016: 2 · 2015: 5 · 2014: 6 · 2013: 4
FWCI
4.03
Type
conference paper
Language
en
Open access
closed
Locations
IEEE Conference on Decision and Control (CDC) (publishedVersion)
Funders
  • National Science Foundation
  • Division of Civil, Mechanical and Manufacturing Innovation
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 › Extremum Seeking Control Systems
Keywords
distributed convex optimization, continuous-time dynamics, directed graphs, convergence analysis, invariance, graph matrices, strongly connected graphs, Lipschitz gradient

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.