CoChat

Distributed Subgradient Methods for Multi-Agent Optimization

Nedic, Angelia, Ozdaglar, Asuman · 2009 · IEEE Transactions on Automatic Control

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

Abstract

We study a distributed computation model for optimizing a sum of convex objective functions corresponding to multiple agents. For solving this (not necessarily smooth) optimization problem, we consider a subgradient method that is distributed among the agents. The method involves every agent minimizing his/her own objective function while exchanging information locally with other agents in the network over a time-varying topology. We provide convergence results and convergence rate estimates for the subgradient method. Our convergence rate results explicitly characterize the tradeoff between a desired accuracy of the generated approximate optimal solutions and the number of iterations needed to achieve the accuracy.

Overview

Integrity signals

Registry

Crossref · 10.1109/tac.2008.2009515

Cites

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

Cited by

See all 3,719

Metadata

Authors
Nedic, A., & Ozdaglar, A.
Affiliations
Massachusetts Institute of Technology (US)
Venue
IEEE Transactions on Automatic Control
Published
2009-01
Volume
54
Issue
1
Pages
48-61
ISSN
0018-9286 (ISSN-L)
OpenAlex
W2044212084
Cited by
3,719
References
36
Citations by year
2026: 185 · 2025: 299 · 2024: 290 · 2023: 299 · 2022: 295 · 2021: 305 · 2020: 370 · 2019: 328 · 2018: 266 · 2017: 236 · 2016: 209 · 2015: 166 · 2014: 127 · 2013: 107 · 2012: 99
FWCI
96.63
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Automatic Control (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, multi-agent systems, subgradient method, convex optimization, time-varying topology, convergence rate, convergence analysis, networked agents, distributed computing

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.