The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Neural network for quadratic optimization with bound constraints
Abstract
A recurrent neural network is presented which performs quadratic optimization subject to bound constraints on each of the optimization variables. The network is shown to be globally convergent, and conditions on the quadratic problem and the network parameters are established under which exponential asymptotic stability is achieved. Through suitable choice of the network parameters, the system of differential equations governing the network activations is preconditioned in order to reduce its sensitivity to noise and to roundoff errors. The optimization method employed by the neural network is shown to fall into the general class of gradient methods for constrained nonlinear optimization and, in contrast with penalty function methods, is guaranteed to yield only feasible solutions.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,031
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Габор, Д. (1946) · Journal of the IEE · Cited by 5,036
Daugman, J. G. (1985) · Journal of the Optical Society of America A · doi:10.1364/josaa.2.001160 · Cited by 3,219
Tank, D., & Hopfield, J. (1986) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1986.1085953 · Cited by 2,194
The Stability of Dynamical Systems
La Salle, J. P. (1976) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970432 · Cited by 2,095
Two-dimensional spectral analysis of cortical receptive field profiles
Daugman, J. G. (1980) · Vision Research · doi:10.1016/0042-6989(80)90065-6 · Cited by 1,208
Nonlinear Programming — Theory and Algorithms
Ovuworie, G. C. (1979) · Journal of the Operational Research Society · doi:10.1057/jors.1979.231 · Cited by 1,182
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
The two-dimensional spatial structure of simple receptive fields in cat striate cortex
Jones, J. P., & Palmer, L. A. (1987) · Journal of Neurophysiology · doi:10.1152/jn.1987.58.6.1187 · Cited by 668
On the Solution of Large Quadratic Programming Problems with Bound Constraints
Moré, J. J., & Toraldo, G. (1991) · SIAM Journal on Optimization · doi:10.1137/0801008 · Cited by 335
The VNR Concise Encyclopedia of Mathematics
Gellert, W., Küstner, H., Hellwich, M., & Kästner, H. (1977) · Springer eBooks · doi:10.1007/978-1-4684-8237-9 · Cited by 195
On learning and energy-entropy dependence in recurrent and nonrecurrent signed networks
Grossberg, S. (1969) · Journal of Statistical Physics · doi:10.1007/bf01007484 · Cited by 186
Exponential stability and a systematic synthesis of a neural network for quadratic minimization
Sudharsanan, S. I., & Sundareshan, M. K. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90014-v · Cited by 106
Relaxation network for Gabor image decomposition
Pattison, T. R. (1992) · Biological Cybernetics · doi:10.1007/bf00201806 · Cited by 8
Self-citation
Cited by
A Comprehensive Review of Stability Analysis of Continuous-Time Recurrent Neural Networks
Zhang, H., Wang, Z., & Liu, D. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2317880 · Cited by 654
A Comprehensive Survey on Deep Graph Representation Learning
Ju, W., Fang, Z., Gu, Y., Liu, Z., Long, Q., Qiao, Z., Qin, Y., Shen, J., Sun, F., Xiao, Z., et al. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106207 · Cited by 341
Metadata
- Authors
- Bouzerdoum, A., & Pattison, T. R.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1993-03
- Volume
- 4
- Issue
- 2
- Pages
- 293-304
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2128332575
- Cited by
- 337
- References
- 18
- FWCI
- 3.23
- 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.