This paper addresses the problem of model reduction for uncertain discrete-time systems with convex bounded (polytope type) uncertainty. A reduced order precisely known model is obtained in such a way that the H 2 and/or the H∞ guaranteed norm of the error between the original (uncertain) system and the reduced one is minimized. The optimization problems are formulated in terms of coupled (nonconvex) linear matrix inequalities, being solved through iterative algorithms. Examples illustrate the results
Published in:
American Control Conference, 1999. Proceedings of the 1999
(Volume:6
)
Date of Conference: 1999