The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Lagrange programming neural networks
Abstract
A class of neural networks appropriate for general nonlinear programming, i.e., problems including both equality and inequality constraints, is analyzed in detail. The methodology is based on the Lagrange multiplier theory in optimization and seeks to provide solutions satisfying the necessary conditions of optimality. The equilibrium point of the network satisfies the Kuhn-Tucker condition for the problem. No explicit restriction is imposed on the form of the cost function apart from some general regularity and convexity conditions. The stability of the neural networks is analyzed in detail. The transient behavior of the network is simulated and the validity of the approach is verified for a practical problem, maximum entropy image restoration.>
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
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
Cellular neural networks: theory
Chua, L. O., & Yang, L. (1988) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.7600 · Cited by 4,769
EPILEPSY AND THE FUNCTIONAL ANATOMY OF THE HUMAN BRAIN
Penfield, W., & Jasper, H. (1954) · Southern Medical Journal · doi:10.1097/00007611-195407000-00024 · Cited by 4,092
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
Tank, D., & Hopfield, J. (1986) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1986.1085953 · Cited by 2,194
Bidirectional associative memories
Kosko, B. (1988) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.87054 · Cited by 2,070
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
A theoretical framework for back-propagation
LeCun, Y. (1988) · Cited by 583
Image restoration using a neural network
Zhou, Y.-T., Chellappa, R., Vaid, A., & Jenkins, B. K. (1988) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.1641 · Cited by 412
(1991) · CVGIP Image Understanding · doi:10.1016/1049-9660(91)90082-z · Cited by 350
Cited by
Kinematic 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 Simplified Dual Neural Network for Quadratic Programming With Its KWTA Application
Liu, S., & Wang, J. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.881046 · Cited by 290
Constrained-CNN losses for weakly supervised segmentation
Kervadec, H., Dolz, J., Tang, M., Granger, E., Boykov, Y., & Ben Ayed, I. (2019) · Medical Image Analysis · doi:10.1016/j.media.2019.02.009 · Cited by 278
Metadata
- Authors
- Zhang, S., & Constantinides, A. G.
- Venue
- IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
- Published
- 1992-07
- Volume
- 39
- Issue
- 7
- Pages
- 441-452
- ISSN
- 1057-7130 (ISSN-L)
- OpenAlex
- W2137743180
- Cited by
- 399
- References
- 13
- FWCI
- 1.79
- 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: Lagrange programming neural networks. https://app.cochat.ai/papers/10.1109/82.160169
- The paper
- Zhang, S., & Constantinides, A. G. (1992). Lagrange programming neural networks. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing. https://doi.org/10.1109/82.160169
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.