Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 234

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

Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach

Open access
Zeng, Xianlin, Yi, Peng, Hong, Yiguang·2017·IEEE Transactions on Automatic Control

Abstract

This technical note studies the distributed optimization problem of a sum of nonsmooth convex cost functions with local constraints. At first, we propose a novel distributed continuous-time projected algorithm, in which each agent knows its local cost function and local constraint set, for the constrained optimization problem. Then we prove that all the agents of the algorithm can find the same optimal solution, and meanwhile, keep the states bounded while seeking the optimal solutions. We conduct a complete convergence analysis by employing nonsmooth Lyapunov functions for the stability analysis of differential inclusions. Finally, we provide a numerical example for illustration.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tac.2016.2628807

Cites

2 of 2 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Show all 2 references

Cited by

See all 234

Metadata

Authors
Zeng, X., Yi, P., & Hong, Y.
Venue
IEEE Transactions on Automatic Control
Published
2017-10
Volume
62
Issue
10
Pages
5227-5233
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W2964211247
Cited by
234
References
2
FWCI
27.16
Type
journal article
Language
en
Open access
green

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 Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach. https://app.cochat.ai/papers/10.1109/tac.2016.2628807
The paper
Zeng, X., Yi, P., & Hong, Y. (2017). Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2016.2628807

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.