Model simplification for switched hybrid systems

This paper is concerned with the problem of H∞H∞ model reduction for switched system, which is an important class of hybrid systems frequently encountered in practical situations. Two sharply different approaches are proposed to solve this problem. The first approach casts the model reduction into a convex optimization problem, which is the first attempt to solve the model reduction problem by using linearization procedure. The second one, based on the cone complementarity linearization idea, casts the model reduction problem into a sequential minimization problem subject to linear matrix inequality constraints. Both approaches have their own advantages and disadvantages concerning conservatism and computational complexity. A numerical example illustrates the effectiveness of the proposed theories.