CoChat

Distributed nonconvex multiagent optimization over time-varying networks

Open access
Sun, Ying, Scutari, Gesualdo, Palomar, Daniel · 2016 · 2016 50th Asilomar Conference on Signals, Systems and Computers

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

Abstract

We study nonconvex distributed optimization in multiagent networks where the communications between nodes is modeled as a time-varying sequence of arbitrary digraphs. We introduce a novel broadcast-based distributed algorithmic framework for the (constrained) minimization of the sum of a smooth (possibly nonconvex and nonseparable) function, i.e., the agents' sum-utility, plus a convex (possibly nonsmooth and nonseparable) regularizer. The latter is usually employed to enforce some structure in the solution, typically sparsity. The proposed method hinges on Successive Convex Approximation (SCA) techniques coupled with i) a tracking mechanism instrumental to locally estimate the gradients of agents' cost functions; and ii) a novel broadcast protocol to disseminate information and distribute the computation among the agents. Asymptotic convergence to stationary solutions is established. A key feature of the proposed algorithm is that it neither requires the double-stochasticity of the consensus matrices (but only column stochasticity) nor the knowledge of the graph sequence to implement. To the best of our knowledge, the proposed framework is the first broadcast-based distributed algorithm for convex and nonconvex constrained optimization over arbitrary, time-varying digraphs. Numerical results show that our algorithm outperforms current schemes on both convex and nonconvex problems.

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/acssc.2016.7869154

Cites

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

Cited by

See all 87

Metadata

Authors
Sun, Y., Scutari, G., & Palomar, D.
Affiliations
  • Purdue University West Lafayette (US)
  • Hong Kong University of Science and Technology (HK)
Venue
2016 50th Asilomar Conference on Signals, Systems and Computers
Publisher
IEEE
Published
2016-11
Pages
788-794
ISSN
1058-6393 (ISSN-L)
OpenAlex
W2963090384
Cited by
86
References
30
Citations by year
2026: 4 · 2024: 6 · 2023: 3 · 2022: 4 · 2021: 4 · 2020: 14 · 2019: 20 · 2018: 21 · 2017: 9 · 2016: 1
FWCI
14.52
Type
conference paper
Language
en
Open access
Locations
  • Asilomar Conference on Signals, Systems and Computers (ACSSC) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (1555850, 1564044, CAREER)
  • Office of Naval Research (N00014-16-1-2244, N00014)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
  • Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
  • Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
Keywords
distributed optimization, non-convex optimization, multi-agent systems, successive convex approximation, gradient tracking, constrained optimization, convergence to stationary solutions

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.