Abstract
In this chapter, we present computational methods for evaluating the infima of discrete-time H ∞ optimal control problems. The main contributions of this chapter are the non-iterative algorithms that exactly compute the values of infima for systems satisfying certain geometric conditions. If these conditions are not satisfied, one might have to use iterative schemes based on certain reduced order systems for approximating these infima. Most of the results of this chapter were reported earlier in Chen [19], and Chen et al. [21].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London
About this chapter
Cite this chapter
Chen, B.M. (2000). Infima in Discrete-time H ∞ Optimization. In: Robust and H∞ Control. Communications and Control Engineering. Springer, London. https://doi.org/10.1007/978-1-4471-3653-8_10
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3653-8_10
Publisher Name: Springer, London
Print ISBN: 978-1-84996-858-4
Online ISBN: 978-1-4471-3653-8
eBook Packages: Springer Book Archive