The DOI matches its Crossref record.
A Steepest-Ascent Method for Solving Optimum Programming Problems
Abstract
A systematic and rapid steepest-ascent numerical procedure is described for solving two-point boundary-value problems in the calculus of variations for systems governed by a set of nonlinear ordinary differential equations. Numerical examples are presented for minimum time-to-climb and maximum altitude paths for a supersonic interceptor and maximum-range paths for an orbital glider.
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
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
Direct trajectory optimization using nonlinear programming and collocation
Hargraves, C. R., & Paris, S. W. (1987) · Journal of Guidance, Control, and Dynamics · doi:10.2514/3.20223 · Cited by 1,161
Constrained minimization methods
Levitin, E. S., & Polyak, B. T. (1966) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(66)90114-5 · Cited by 846
Automatic differentiation in machine learning: a survey
Baydin, A. G., Pearlmutter, B. A., Radul, A., & Siskind, J. M. (2015) · arXiv (Cornell University) · doi:10.4230/lipics.ecoop.2019.25 · Cited by 823
Learning State Space Trajectories in Recurrent Neural Networks
Pearlmutter, B. A. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.263 · Cited by 656
Gradient calculations for dynamic recurrent neural networks: a survey
Pearlmutter, B. A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.410363 · Cited by 582
On the estimation of state variables and parameters for noisy dynamic systems
Cox, H. (1964) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1964.1105635 · Cited by 475
A recurrent fuzzy-neural model for dynamic system identification
Mastorocostas, P. A., & Theocharis, J. B. (2002) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.990874 · Cited by 261
Gradient descent learning algorithm overview: a general dynamical systems perspective
Baldi, P. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363438 · Cited by 258
Optimal control of a qubit in an optical cavity
Deffner, S. (2014) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/0953-4075/47/14/145502 · Cited by 75
Demystifying differentiable programming: shift/reset the penultimate backpropagator
Wang, F., Zheng, D., Decker, J., Wu, X., Essertel, G. M., & Rompf, T. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3341700 · Cited by 59
Metadata
- Authors
- Bryson, A. E., & Denham, W. F.
- Venue
- Journal of Applied Mechanics
- Publisher
- ASME International
- Published
- 1962-06-01
- Volume
- 29
- Issue
- 2
- Pages
- 247-257
- ISSN
- 0021-8936 (ISSN-L)
- 1528-9036
- OpenAlex
- W1996647346
- Cited by
- 492
- References
- 0
- FWCI
- 81.31
- 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.