A new vertex result for robustness problems with interval matrix uncertainty

This paper1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a new vertex result that drastically reduces the number of extreme realizations required to check robust feasibility. This vertex result allows one to solve, in a deterministic way and without introducing conservatism, the corresponding robustness problem for small and medium size problems. For example, consider quadratic stability of an autonomous nx dimensional system. In this case, instead of checking 2n2 x vertices, we show that it suffices to check 22nx specially constructed systems. This solution is still exponential, but this is not surprising because the problem is NP-hard. Finally, vertex extensions to multiaffine interval families and some sufficient conditions (in LMI form) for robust feasibility are presented. Some illustrative examples are also given. c 2007 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2008
• Where: SCL
• Authors: Teodoro Alamo, Roberto Tempo, Daniel R. Ramírez, Eduardo F. Camacho
• Keywords: Interval Matrix Uncertainty, Robust Feasibility, Robustness Problem, SCL 2008