Abstract
This chapter will discuss the proofs of optimality of most of the algorithms discussed in the context of control optimization. Since all the related algorithms are iterative and generate sequences of values, we will be dealing with convergence of these sequences to optimal solutions.
Nothing is ever settled until it is settled right.
— Rudyard Kipling (1865–1936)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gosavi, A. (2003). Convergence Analysis of Control Optimization Methods. In: Simulation-Based Optimization. Operations Research/Computer Science Interfaces Series, vol 25. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3766-0_13
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3766-0_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5354-4
Online ISBN: 978-1-4757-3766-0
eBook Packages: Springer Book Archive