By Topic

On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Leonid Gurvits ; Los Alamos Nat. Lab., Los Alamos, NM ; Alexander Olshevsky

Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in Rntimesn are stable. In particular, we are interested whether there exist algorithms which can solve this problem in time polynomial in n and k. We show that if k=nd for any fixed real d > 0, then the problem is NP-hard, meaning that no polynomial-time algorithm in n exists provided that P ne NP, a widely believed conjecture in computer science. On the other hand, when k is a constant independent of n, then it is known that the problem may be solved in polynomial time in n. Using these results and the method of measurable switching rules, we prove our main statement: verifying the absolute asymptotic stability of a continuous-time switched linear system with more than nd matrices Ai isin Rntimesn satisfying 0 ges Ai + Ai T is NP-hard.

Published in:

IEEE Transactions on Automatic Control  (Volume:54 ,  Issue: 2 )