CoChat

On Distributed Convex Optimization Under Inequality and Equality Constraints

Minghui Zhu, Martinez, S. · 2012 · 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 general multi-agent convex optimization problem where the agents are to collectively minimize a global objective function subject to a global inequality constraint, a global equality constraint, and a global constraint set. The objective function is defined by a sum of local objective functions, while the global constraint set is produced by the intersection of local constraint sets. In particular, we study two cases: one where the equality constraint is absent, and the other where the local constraint sets are identical. We devise two distributed primal-dual subgradient algorithms based on the characterization of the primal-dual optimal solutions as the saddle points of the Lagrangian and penalty functions. These algorithms can be implemented over networks with dynamically changing topologies but satisfying a standard connectivity property, and allow the agents to asymptotically agree on optimal solutions and optimal values of the optimization problem under the Slater's condition.

Overview

Integrity signals

Registry

Crossref · 10.1109/tac.2011.2167817

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 769

Metadata

Authors
Zhu, M., & Martinez, S.
Affiliations
University of California San Diego (US)
Venue
IEEE Transactions on Automatic Control
Published
2012-01
Volume
57
Issue
1
Pages
151-164
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W2022948311
Cited by
759
References
36
Citations by year
2026: 13 · 2025: 38 · 2024: 33 · 2023: 44 · 2022: 46 · 2021: 62 · 2020: 78 · 2019: 74 · 2018: 74 · 2017: 81 · 2016: 82 · 2015: 60 · 2014: 32 · 2013: 23 · 2012: 17
FWCI
30.95
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 convex optimization, multi-agent systems, inequality constraints, equality constraints, saddle points, Lagrangian, penalty method, Slater's condition

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.