Distributed Time-Varying Quadratic Optimization for Multiple Agents Under Undirected Graphs
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
This paper considers a class of distributed quadratic optimization problem under an undirected and connected graph. Different from most of the existing distributed optimization works that consider the optimal solutions to be constants, the optimal solution and the objective functions at the optimal solution are both assumed to be time varying. For the case where there is no constraint on the decision variables, gradient-based searching methods are proposed to track the unknown optimal solution. The tracking errors are proven to be asymptotically stable. For the case where there exists a local compact convex constraint set for each agent, projected gradient-based methods are proposed for both neighboring coupled and generally coupled objective functions, and the tracking errors are proven to be uniformly ultimately bounded with arbitrarily small bound.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 event-triggered control for multi-agent systems
Dimarogonas, D. V., Frazzoli, E., & Johansson, K. H. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2174666 · Cited by 2,556
Distributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187
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
Multi-Agent Distributed Optimization via Inexact Consensus ADMM
Chang, T.-H., Hong, M., & Wang, X. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2367458 · Cited by 444
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
Metadata
- Authors
- Sun, C., Ye, M., & Hu, G.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2017-07
- Volume
- 62
- Issue
- 7
- Pages
- 3687-3694
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2590184275
- Cited by
- 160
- References
- 6
- FWCI
- 10.09
- 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: Distributed Time-Varying Quadratic Optimization for Multiple Agents Under Undirected Graphs. https://app.cochat.ai/papers/10.1109/tac.2017.2673240
- The paper
- Sun, C., Ye, M., & Hu, G. (2017). Distributed Time-Varying Quadratic Optimization for Multiple Agents Under Undirected Graphs. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2017.2673240
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.