CoChat

Asynchronous Broadcast-Based Convex Optimization Over a Network

Nedic, Angelia · 2011 · 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 consider a distributed multi-agent network system where each agent has its own convex objective function, which can be evaluated with stochastic errors. The problem consists of minimizing the sum of the agent functions over a commonly known constraint set, but without a central coordinator and without agents sharing the explicit form of their objectives. We propose an asynchronous broadcast-based algorithm where the communications over the network are subject to random link failures. We investigate the convergence properties of the algorithm for a diminishing (random) stepsize and a constant stepsize, where each agent chooses its own stepsize independently of the other agents. Under some standard conditions on the gradient errors, we establish almost sure convergence of the method to an optimal point for diminishing stepsize. For constant stepsize, we establish some error bounds on the expected distance from the optimal point and the expected function value. We also provide numerical results.

Overview

Integrity signals

Registry

Crossref · 10.1109/tac.2010.2079650

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

Show all 36 references

Research works printed but not linked: 2

  1. lobel, 2008, Distributed subgradient methods over random networks
  2. ram, 2010, Sensor Networks When Theory Meets Practice

Cited by

See all 326

Metadata

Authors
Nedic, A.
Venue
IEEE Transactions on Automatic Control
Published
2011-06
Volume
56
Issue
6
Pages
1337-1351
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W2130263842
Cited by
310
References
36
Citations by year
2026: 2 · 2025: 14 · 2024: 17 · 2023: 12 · 2022: 10 · 2021: 20 · 2020: 38 · 2019: 36 · 2018: 33 · 2017: 30 · 2016: 21 · 2015: 21 · 2014: 21 · 2013: 15 · 2012: 14
FWCI
15.51
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 › Artificial Intelligence › Stochastic Gradient Optimization Techniques
Keywords
distributed convex optimization, multi-agent systems, random link failures, constant step size, almost sure convergence, error bounds, distributed 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: Asynchronous Broadcast-Based Convex Optimization Over a Network. https://app.cochat.ai/papers/10.1109/tac.2010.2079650
The paper
Nedic, A. (2011). Asynchronous Broadcast-Based Convex Optimization Over a Network. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2010.2079650

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.