Show simple item record

dc.contributor.authorColeman, Thomas F.en_US
dc.contributor.authorLiao, Aipingen_US
dc.date.accessioned2007-04-02T21:19:15Z
dc.date.available2007-04-02T21:19:15Z
dc.date.issued2003-11-11en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.tc/2003-289en_US
dc.identifier.urihttps://hdl.handle.net/1813/5463
dc.description.abstractDiscrete-time optimal control (DTOC) problems are large-scale optimization problems with a dynamic structure. In previous work this structure has been exploited to provide very fast and efficient local procedures. Two examples are the differential dynamic programming algorithm (DDP) and the stagewise Newton procedure -- both require only O(N) operations per iteration, where N is the number of timesteps. Both exhibit a quadratic convergence rate. However, most algorithms in this category do not have a satisfactory global convergence strategy. The most popular global strategy is shifting: this sometimes works poorly due to the lack of automatic adjustment to the shifting element. In this paper we propose a method that incorporates the trust region idea with the local stagewise Newton's method. This method possesses advantages of both the trust region idea and the stagewise Newton's method, i.e., our proposed method has strong global and local convergence properties yet remains economical. Preliminary numerical results are presented to illustrate the behavior of the proposed algorithm. We also collect in the Appendix some DTOC problems that have appeared in the literature.en_US
dc.format.extent230879 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjecttheory centeren_US
dc.titleAn efficient trust region method for unconstrained discrete-time optimal control problemsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics