A Steepest-Ascent Method for Solving Optimum Programming Problems
Keyword(s):
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.
1967 ◽
Vol 22
(6)
◽
pp. 871-881
◽
2016 ◽
Vol 21
(2)
◽
pp. 270-281
1980 ◽
Vol 15
(3)
◽
pp. 464-469
◽
1988 ◽
Vol 8
(3)
◽
pp. 239-248
◽
2014 ◽
Vol 58
(1)
◽
pp. 183-197
◽
1976 ◽
Vol 61
(1)
◽
pp. 81-81
◽