The DOI matches its Crossref record.
The numerical solution of variational problems
Open accessAbstract
In two earlier papers [l, 21 we have derived various conditions that must be satisfied by a curve if it is to be a solution of a variational problem. In [l] we considered mainly the classical problem of Lagrange. In [2] we studied the problem of Mayer and investigated the conditions implied by the introduction of inequality constraints on either the shape of the solution curve (decision variable constraints) or the region in which it could lie (state variable constraints). In this paper we shall discuss the numerical solution of variational problems of both the conventional and inequality-constrained types. We shall outline briefly what, until recently, has been the usual approach. Then we shall consider a gradient technique that has proved very successful in practice. This approach is known to a few practitioners of the numerical art such as Kelley [3] and Bryson [4]. Our derivation, using essentially the same concepts and techniques of dynamic programming that we employed in ref. 1 and 2, is both new and simple. We conclude this paper with a discussion of the numerical solution of a variant of the classical brachistochrone problem where a state variable inequality constraint has been introduced but for which the analytic solution is still known. We shall assume that the reader is familiar with such dynamic programming terms as “state variable,” “decision variable,” “optimal return function,” etc., that were introduced in our two previous papers and also with the different Lagrange multiplier relationships that hold on and off the boundary, as derived in [2].
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
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Deep Convolutional Neural Networks for Image Classification: A Comprehensive Review
Rawat, W., & Wang, Z. (2017) · Neural Computation · doi:10.1162/neco_a_00990 · Cited by 3,503
Artificial intelligence to deep learning: machine intelligence approach for drug discovery
Gupta, R., Srivastava, D., Sahu, M., Tiwari, S., Ambasta, R. K., & Kumar, P. (2021) · Molecular Diversity · doi:10.1007/s11030-021-10217-3 · Cited by 1,473
“Henry J. Kelley developed the continuous backpropagation model in 1960, and a simpler version based only on-chain rule was developed by Stuart Dreyfus in 1962 [22, 23].”
BackgroundElements of Artificial Neural Networks
Mehrotra, K., Mohan, C., & Ranka, S. (1996) · The MIT Press eBooks · doi:10.7551/mitpress/2687.001.0001 · Cited by 912
Plant Disease Detection and Classification by Deep Learning
Saleem, M. H., Potgieter, J., & Arif, K. M. (2019) · Plants · doi:10.3390/plants8110468 · Cited by 886
Metadata
- Authors
- Dreyfus, S.
- Venue
- Journal of Mathematical Analysis and Applications
- Publisher
- Elsevier BV
- Published
- 1962-08
- Volume
- 5
- Issue
- 1
- Pages
- 30-45
- ISSN
- 0022-247X (ISSN-L)
- OpenAlex
- W1985835389
- Cited by
- 172
- References
- 0
- FWCI
- 3.11
- Type
- journal article
- Language
- en
- Open access
- bronze
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: The numerical solution of variational problems. https://app.cochat.ai/papers/10.1016/0022-247x(62)90004-5
- The paper
- Dreyfus, S. (1962). The numerical solution of variational problems. Journal of Mathematical Analysis and Applications. https://doi.org/10.1016/0022-247x(62)90004-5
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.