DocumentCode :
3074591
Title :
Algorithms for computing the optimal H norm
Author :
Pandey, Pradeep ; Kenney, Charles ; Laub, Alan J. ; Packard, Andy
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
fYear :
1990
fDate :
5-7 Dec 1990
Firstpage :
2628
Abstract :
A gradient method for computing the optimal norm for a general H control problem is presented. This method is much faster than a bisection method and the additional cost of computing the gradient is small. Convergence is predicated on the smoothness of the spectral radius of the product of certain Riccati solutions. Hybrid bisection-gradient methods can be used in the nonsmooth case. The problem of the ill-conditioning of the Riccati equations as the solution approaches the optimal value is also addressed. It is shown that the required gradient can be formed using invariant subspaces of the associated Hamiltonians rather than explicitly forming the Riccati solutions
Keywords :
control system synthesis; convergence; optimal control; stability; H control problem; gradient method; hybrid bisection-gradient methods; ill-conditioned Riccati equations; optimal H norm; Cost function; Eigenvalues and eigenfunctions; Gradient methods; H infinity control; Riccati equations; Taylor series; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 1990., Proceedings of the 29th IEEE Conference on
Conference_Location :
Honolulu, HI
Type :
conf
DOI :
10.1109/CDC.1990.203347
Filename :
203347
Link To Document :
بازگشت