A Steepest-Ascent Method for Solving Optimum Programming Problems
Arthur E. Bryson, WALTER F. DENHAM · Journal of Applied Mechanics · 1962
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.
Cited by 492 works. doi:10.1115/1.3640537