The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Constrained Consensus Algorithms With Fixed Step Size for Distributed Convex Optimization Over Multiagent Networks
Abstract
In this technical note, we are concerned with constrained consensus algorithms for distributed convex optimization with a sum of convex objective functions subject to local bound and equality constraints. In multiagent networks, each agent has its own data on objective function and constraints. All the agents cooperatively find the minimizer, while each agent can only communicate with its neighbors. The consensus of multiagent networks with time-invariant and undirected graphs is proven by the Lyapunov method. Compared with existing consensus algorithms for distributed optimization with diminishing step sizes, the proposed algorithms with fixed step size have better convergence rate. Simulation results on a numerical example are presented to substantiate the performance and characteristics of the proposed algorithms.
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.
Integrity signals
Registry
Cites
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.
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261
On Distributed Convex Optimization Under Inequality and Equality Constraints
Zhu, M., & Martinez, S. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2167817 · Cited by 759
Distributed Subgradient Methods for Convex Optimization Over Random Networks
Lobel, I., & Ozdaglar, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2091295 · Cited by 351
Cited by
An Overview of Recent Advances in Event-Triggered Consensus of Multiagent Systems
Ding, L., Han, Q.-L., Ge, X., & Zhang, X.-M. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2771560 · Cited by 1,182
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Self-citation
Metadata
- Authors
- Liu, Q., Yang, S., & Hong, Y.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2017-08
- Volume
- 62
- Issue
- 8
- Pages
- 4259-4265
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2602885853
- Cited by
- 184
- References
- 5
- FWCI
- 13.39
- Type
- journal article
- Language
- en
- Open access
- closed
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: Constrained Consensus Algorithms With Fixed Step Size for Distributed Convex Optimization Over Multiagent Networks. https://app.cochat.ai/papers/10.1109/tac.2017.2681200
- The paper
- Liu, Q., Yang, S., & Hong, Y. (2017). Constrained Consensus Algorithms With Fixed Step Size for Distributed Convex Optimization Over Multiagent Networks. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2017.2681200
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.