\input zb-basic
\input zb-ioport
\iteman{io-port 04082378}
\itemau{Dunn, J.C.; Bertsekas, D.P.}
\itemti{Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems.}
\itemso{J. Optimization Theory Appl. 63, No.1, 23-38 (1989).}
\itemab
Naive implementations of Newton's method for unconstrained N-stage discrete-time optimal control problems with Bolza objective functions tend to increase in cost like $N\sp 3$ as N increases. However, if the inherent recursive structure of the Bolza problem is properly exploited, the cost of computing a Newton step will increase only linearly with N. The efficient Newton implementation scheme proposed here is similar to Mayne's DDP (differential dynamic programming) method but produces the Newton step exactly, even when the dynamical equations are nonlinear. The proposed scheme is also related to a Riccati treatment of the linear, two-point boundary-value problems that characterize optimal solutions. For discrete-time problems, the dynamic programming approach and the Riccati substitution differ in an interesting way; however, these differences essentially vanish in the continuous-time limit.
\itemrv{J.C.Dunn}
\itemcc{}
\itemut{Newton's method; unconstrained N-stage discrete-time optimal control problems; Bolza objective functions; dynamic programming}
\itemli{doi:10.1007/BF00940728}
\end