Convergence of the forward-backward sweep method in optimal control
The Forward-Backward Sweep Method is a numerical technique for solving optimal control problems. The technique is one of the indirect methods in which the differential equations from the Maximum Principle are numerically solved. After the method is briefly reviewed, two convergence theorems are proved for a basic type of optimal control problem. The first shows that recursively solving the system of differential equations will produce a sequence of iterates converging to the solution of the system. The second theorem shows that a discretized implementation of the continuous system also converges as the iteration and number of subintervals increases. The hypotheses of the theorem are a combination of basic Lipschitz conditions and the length of the interval of integration. An example illustrates the performance of the method. Copyright Springer Science+Business Media, LLC 2012
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 53 (2012)
Issue (Month): 1 (September)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/math/journal/10589|
When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:53:y:2012:i:1:p:207-226. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.