Abstract
Algorithms for optimal control problems can be analysed in the same way as algorithms for nonlinear programming problems. The compactness of the space of relaxed controls is only needed to guarantee boundedness of penalty parameters.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this chapter
Cite this chapter
Pytlak, R. (1999). First order method. In: Numerical Methods for Optimal Control Problems with State Constraints. Lecture Notes in Mathematics, vol 1707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0097247
Download citation
DOI: https://doi.org/10.1007/BFb0097247
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66214-3
Online ISBN: 978-3-540-48662-6
eBook Packages: Springer Book Archive