|
|
||||||||
Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology, Technion City, Haifa 32000, Israel
In this paper, we study semi-infinite systems of Linear Matrix Inequalities which are generically NP-hard. For these systems, we introduce computationally tractable approximations and derive quantitative guarantees of their quality. As applications, we discuss the problem of maximizing a Hermitian quadratic form over the complex unit cube and the problem of bounding the complex structured singular value. With the help of our complex Matrix Cube Theorem we demonstrate that the standard scaling upper bound on µ(M) is a tight upper bound on the largest level of structured perturbations of the matrix M for which all perturbed matrices share a common Lyapunov certificate for the (discrete time) stability.
Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology, Technion City, Haifa 32000, Israel
Faculty of Information Technology and Systems, Delft University of Technology, Mekelweg 4, 2628 CD Delft, The Netherlands
abental{at}ie.technion.ac.il
nemirovs{at}ie.technion.ac.il
c.roos{at}its.tudelft.nl
History: Received: November 6, 2001;
revision received: January 13, 2003;
This article has been cited by other articles:
![]() |
A. Ben-Tal and A. Nemirovski On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities Mathematics of Operations Research, February 1, 2009; 34(1): 1 - 25. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |