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.
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., & 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
Discontinuous dynamical systems
(2008) · IEEE Control Systems · doi:10.1109/mcs.2008.919306 · Cited by 1,068
Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
Gharesifard, B., & Cortes, J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2278132 · Cited by 833
Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2010) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9737-7 · Cited by 814 · cited 1×
“Some distributed optimization algorithms based on the subgradient method are developed, including the algorithm with the presence of noise [5], a distributed simplex algorithm for solving degenerate linear programs and multiagent assignments [7], a cutting-plane consensus algorithm for robust distributed optimization…”
MethodOn 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 consensus of linear multi-agent systems with adaptive dynamic protocols
Li, Z., Ren, W., Liu, X., & Xie, L. (2013) · Automatica · doi:10.1016/j.automatica.2013.03.015 · Cited by 672
Yu, W., Ren, W., Zheng, W. X., Chen, G., & Lü, J. (2013) · Automatica · doi:10.1016/j.automatica.2013.03.005 · Cited by 423
Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case
Lu, J., & Tang, C. Y. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2184199 · Cited by 403
A Second-Order Multi-Agent Network for Bound-Constrained Distributed Optimization
Liu, Q., & Wang, J. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2416927 · Cited by 397
Self-citationDiscontinuous Dynamical Systems: A tutorial on solutions, nonsmooth analysis, and stability
Cortés, J. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0901.3583 · Cited by 397
Stability and Stabilization of Discontinuous Systems and Nonsmooth Lyapunov Functions
Bacciotti, A., & Ceragioli, F. (1999) · ESAIM Control Optimisation and Calculus of Variations · doi:10.1051/cocv:1999113 · Cited by 384
Lin, P., & Jia, Y. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2040500 · Cited by 372
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
Distributed Optimization Based on a Multiagent System in the Presence of Communication Delays
Yang, S., Liu, Q., & Wang, J. (2017) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2016.2531649 · Cited by 289
Self-citationLiu, Q., & Wang, J. (2013) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2244908 · Cited by 248
Self-citationMei, J., Ren, W., & Ma, G. (2013) · Automatica · doi:10.1016/j.automatica.2013.01.058 · Cited by 217
A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
Yan, Z., Wang, J., & Li, G. (2014) · Neural Networks · doi:10.1016/j.neunet.2014.03.006 · Cited by 126
Self-citationA new class of distributed optimization algorithms: Application to regression of distributed data
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2012) · Optimization Methods and Software · doi:10.1080/10556788.2010.511669 · Cited by 123
A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
Bürger, M., Notarstefano, G., Bullo, F., & Allgöwer, F. (2012) · Automatica · doi:10.1016/j.automatica.2012.06.040 · Cited by 100
A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization
Bürger, M., Notarstefano, G., & Allgöwer, F. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2281883 · Cited by 80
Consensus of second-order multi-agent systems via impulsive control using sampled hetero-information
Ding, L., Yu, P., Liu, Z., et al. (2013) · Automatica · doi:10.1016/j.automatica.2013.06.014 · Cited by 57
Distributed Random Convex Programming via Constraints Consensus
Carlone, L., Srivastava, V., Bullo, F., & Calafiore, G. C. (2014) · SIAM Journal on Control and Optimization · doi:10.1137/120885796 · Cited by 32
Periodic and event-triggered communication for distributed continuous-time convex optimization
Kia, S. S., Cortés, J., & Martínez, S. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859122 · Cited by 20
On distributed optimization under inequality constraints via Lagrangian primal-dual methods
Zhu, M., & Martínez, S. (2010) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2010.5530903 · Cited by 16
Distributed continuous-time gradient-based algorithm for constrained optimization
Yi, P., & Hong, Y. (2014) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2014.6896861 · Cited by 11
Distributed coordination for separable convex optimization with coupling constraints
Niederländer, S. K., & Cortés, J. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402310 · Cited by 8
Continuous-time constrained distributed convex optimization
Doan, T. T., & Tang, C. Y. (2012) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2012.6483394 · Cited by 5
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
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
A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
Yang, S., Liu, Q., & Wang, J. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2610945 · Cited by 314
Self-citation
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
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.