Actions for Comparison of a discrete steepest ascent method with the continuous steepest ascent method for optimal programing

Email RIS file
Bookmark
Report an Issue

Comparison of a discrete steepest ascent method with the continuous steepest ascent method for optimal programing

Author
Childs, A. G.
Published
Dec 1, 1971.
Physical Description
1 electronic document
Online Version

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access
Summary
A discrete steepest ascent method which allows controls which are not piecewise constant (for example, it allows all continuous piecewise linear controls) was derived for the solution of optimal programming problems. This method is based on the continuous steepest ascent method of Bryson and Denham and new concepts introduced by Kelley and Denham in their development of compatible adjoints for taking into account the effects of numerical integration. The method is a generalization of the algorithm suggested by Canon, Cullum, and Polak with the details of the gradient computation given. The discrete method was compared with the continuous method for an aerodynamics problem for which an analytic solution is given by Pontryagin's maximum principle, and numerical results are presented. The discrete method converges more rapidly than the continuous method at first, but then for some undetermined reason, loses its exponential convergence rate. A comparison was also made for the algorithm of Canon, Cullum, and Polak using piecewise constant controls. This algorithm is very competitive with the continuous algorithm.
Other Subject(s)
Collection
NASA Technical Reports Server (NTRS) Collection.
Note
Document ID: 19720004882.
Accession ID: 72N12531.
NASA-TN-D-6549.
L-7949.
Terms of Use and Reproduction
No Copyright.
View MARC record | catkey: 15948039