The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
A Collective Neurodynamic Approach to Distributed Constrained Optimization
Abstract
This paper presents a collective neurodynamic approach with multiple interconnected recurrent neural networks (RNNs) for distributed constrained optimization. The objective function of the distributed optimization problems to be solved is a sum of local convex objective functions, which may be nonsmooth. Subject to its local constraints, each local objective function is minimized individually by using an RNN, with consensus among others. In contrast to existing continuous-time distributed optimization methods, the proposed collective neurodynamic approach is capable of solving more general distributed optimization problems. Simulation results on three numerical examples are discussed to substantiate the effectiveness and characteristics of the proposed approach. In addition, an application to the optimal placement problem is delineated to demonstrate the viability of the approach.
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., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.-B., & Lemaréchal, C. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02796-7 · Cited by 2,378
Nonlinear Programming: Theory and Algorithms
Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (2006) · Wiley eBooks · doi:10.1002/0471787779 · Cited by 2,369
Tank, D., & Hopfield, J. (1986) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1986.1085953 · Cited by 2,194
Constrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086
Neural networks for nonlinear programming
Kennedy, M. P., & Chua, L. O. (1988) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.1783 · Cited by 1,111
Cited by
Distributed Optimization for Multiagent Systems: An Edge-Based Fixed-Time Consensus Approach
Ning, B., Han, Q.-L., & Zuo, Z. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2766762 · Cited by 328
Metadata
- Authors
- Liu, Q., Yang, S., & Wang, J.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2017-08
- Volume
- 28
- Issue
- 8
- Pages
- 1747-1758
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2341544006
- Cited by
- 262
- References
- 36
- FWCI
- 24.00
- 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: A Collective Neurodynamic Approach to Distributed Constrained Optimization. https://app.cochat.ai/papers/10.1109/tnnls.2016.2549566
- The paper
- Liu, Q., Yang, S., & Wang, J. (2017). A Collective Neurodynamic Approach to Distributed Constrained Optimization. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2016.2549566
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.