CoChat

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

Distributed Subgradient Methods for Convex Optimization Over Random Networks

Lobel, Ilan, Ozdaglar, Asuman · 2011 · IEEE Transactions on Automatic Control

Abstract

We consider the problem of cooperatively minimizing the sum of convex functions, where the functions represent local objective functions of the agents. We assume that each agent has information about his local function, and communicate with the other agents over a time-varying network topology. For this problem, we propose a distributed subgradient method that uses averaging algorithms for locally sharing information among the agents. In contrast to previous works on multi-agent optimization that make worst-case assumptions about the connectivity of the agents (such as bounded communication intervals between nodes), we assume that links fail according to a given stochastic process. Under the assumption that the link failures are independent and identically distributed over time (possibly correlated across links), we provide almost sure convergence results for our subgradient algorithm.

Overview

Integrity signals

Registry

Crossref · 10.1109/tac.2010.2091295

Cites

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

Show all 28 references

Research works printed but not linked: 1

  1. bertsimas, 1985, Linear Optimization

Cited by

See all 351

Metadata

Authors
Lobel, I., & Ozdaglar, A.
Affiliations
  • New York University (US)
  • Massachusetts Institute of Technology (US)
Venue
IEEE Transactions on Automatic Control
Published
2011-06
Volume
56
Issue
6
Pages
1291-1306
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W2106901427
Cited by
351
References
28
Citations by year
2026: 6 · 2025: 8 · 2024: 14 · 2023: 13 · 2022: 15 · 2021: 27 · 2020: 26 · 2019: 36 · 2018: 38 · 2017: 37 · 2016: 37 · 2015: 30 · 2014: 25 · 2013: 14 · 2012: 11
FWCI
17.33
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 › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
Keywords
convex optimization, multi-agent optimization, time-varying topology, random networks, link failure, averaging algorithms, almost sure convergence, cooperative optimization

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 Subgradient Methods for Convex Optimization Over Random Networks. https://app.cochat.ai/papers/10.1109/tac.2010.2091295
The paper
Lobel, I., & Ozdaglar, A. (2011). Distributed Subgradient Methods for Convex Optimization Over Random Networks. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2010.2091295

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.