The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A One-Layer Projection Neural Network for Nonsmooth Optimization Subject to Linear Equalities and Bound Constraints
Abstract
This paper presents a one-layer projection neural network for solving nonsmooth optimization problems with generalized convex objective functions and subject to linear equalities and bound constraints. The proposed neural network is designed based on two projection operators: linear equality constraints, and bound constraints. The objective function in the optimization problem can be any nonsmooth function which is not restricted to be convex but is required to be convex (pseudoconvex) on a set defined by the constraints. Compared with existing recurrent neural networks for nonsmooth optimization, the proposed model does not have any design parameter, which is more convenient for design and implementation. It is proved that the output variables of the proposed neural network are globally convergent to the optimal solutions provided that the objective function is at least pseudoconvex. Simulation results of numerical examples are discussed to demonstrate the effectiveness and characteristics of the proposed neural network.
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
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
Cited by
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-citationKinematic Control of Redundant Manipulators Using Neural Networks
Li, S., Zhang, Y., & Jin, L. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2574363 · Cited by 337
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-citationRobot manipulator control using neural networks: A survey
Jin, L., Li, S., Yu, J., & He, J. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.01.002 · Cited by 313
A Collective Neurodynamic Approach to Distributed Constrained Optimization
Liu, Q., Yang, S., & Wang, J. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2549566 · Cited by 262
Self-citation
Metadata
- Authors
- Liu, Q., & Wang, J.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2013-05
- Volume
- 24
- Issue
- 5
- Pages
- 812-824
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W1988901237
- Cited by
- 248
- References
- 1
- FWCI
- 24.07
- 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 One-Layer Projection Neural Network for Nonsmooth Optimization Subject to Linear Equalities and Bound Constraints. https://app.cochat.ai/papers/10.1109/tnnls.2013.2244908
- The paper
- Liu, Q., & Wang, J. (2013). A One-Layer Projection Neural Network for Nonsmooth Optimization Subject to Linear Equalities and Bound Constraints. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2013.2244908
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.