On the NP-hardness of checking matrix polytope stability and continuous-time switching stability

IEEE Transactions on Automatic Control

Volumn 54, Issue 2, 2009, Pages 337-341

  Gurvits, Leonid ^a   Olshevsky, Alexander ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Robust control; Switched systems; Uncertain systems

Indexed keywords

ASYMPTOTIC STABILITY; CONTINUOUS TIME SYSTEMS; DYNAMICAL SYSTEMS; LINEAR CONTROL SYSTEMS; POLYNOMIAL APPROXIMATION; ROBUST CONTROL; SWITCHING SYSTEMS; UNCERTAIN SYSTEMS;

CONTINUOUS-TIME; CONVEX COMBINATIONS; LINEAR DYNAMICAL SYSTEMS; MATRIXES; NP HARDNESS; NP-HARD; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; POLYTOPE; PROBLEM CHECKING; SWITCHED LINEAR SYSTEMS; SWITCHED SYSTEMS; SWITCHING RULES; TIME POLYNOMIALS;

SYSTEM STABILITY;

EID: 61349096160     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2008.2007177     Document Type: Article

References (29)

1. S. Bialas, "A necessary and sufficient condition for the stability of convex combinations of polynomials and matrices," Bulletin Polish Acad. Sci. Tech. Sci., vol. 33, pp. 473-480, 1985.
2. B. Barmish, New Tools for Robustness of Linear Systems. New York: MacMillan, 1995.
3. S. Basu, R. Pollack, and M.-F. Roy, "On the combinatorial and algebraic complexity of quantifier elimination," J. ACM, vol. 43, p. 1002, 1996.
4. P.-A. Bliman, "A convex approach to robust stability for linear systems with uncertain scalar parameters," SIAM J. Control Optim., vol. 42, no. 6, pp. 2016-2042, 2004.
5. V. D. Blondel and J. N. Tsitsiklis, "The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - When not impossible - To compute and to approximate," Math. Control, Signals Syst., vol. 10, no. 1, pp. 31-40, 1997.
6. V. D. Blondel and J. N. Tsitsiklis, "A survey of computational complexity results in systems and control," Automatica, vol. 36, no. 9, pp. 1249-1274, Sep. 2000.
7. R. B. Barmish, M. Fu, and S. Saleh, "Stability of a polytope of matrices: Counterexamples," IEEE Trans. Automat. Control, vol. AC-33, no. 6, pp. 569-572, Jun. 1988.
8. G. Chesi, "Establishing stability and instability of matrix hypercubes," Syst. Control Lett., vol. 54, no. 4, pp. 381-388, Apr. 2005.
9. G. Chesi, A. Garulli, A. Tesi, and A. Vicino, "Polynomially parameter-dependent Lyapunov functions for robust stability of polytopic systems: An LMI approach," IEEE Trans. Automat. Control, vol. 50, no. 3, pp. 365-370, Mar. 2005.
10. N. Cohen and I. Lewkowicz, "A necessary and sufficient criterion for stability of convex sets of matrices," IEEE Trans. Automat. Control vol. 38, no. 4, pp. 611-615, Apr. 1993.
11. M. Fu and R. Barmish, "Maximal unidirectional perturbation bounds for the stability of polynomials and matrices," Syst. Control Lett., vol. 11, no., pp. 173-179, 1988.
12. L. Gurvits, "Stability of Linear Inclusions: Part 2," NEC, Res. Rep. TR96-173, 1996.
13. L. Gurvits, "Stabilities and controllabilities of switched systems (with applications to the quantum systems)," in Proc. 15th Int. Symp. Math. Theory Networks Syst. (MTNS'02), 2002 [Online]. Available: http://www.nd.edu/~mtns/./papers/14043.pdf
14. L. Gurvits, "What is the finiteness conjecture for linear continuous time inclusions?," in Proc. 42nd IEEE Conf. Decision Control (CDC'03), Dec. 2003, pp. 1165-1169.
15. L. Gurvits and A. Olshevsky, "Stability testing of matrix polytopes," in Proc. Eur. Control Conf., Jul. 2007, [CD ROM].
16. D. Henrion, D. Arzelier, D. Peaucelle, and J. B. Lasserre, "On parameter-dependent Lyapunov functions for robust stability of linear systems," in Proc. IEEE Conf. Decision Control, Dec. 2004, pp. 887-892.
17. R. M. Karp, "Reducibility among combinatorial problems," in Complexity in Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum Press, 1972, pp. 85-103.
18. V. Monov, "On the spectrum of convex sets of matrices," IEEE Trans. Automat. Control, vol. 44, no. 5, pp. 1009-1012, May 1999.
19. T. S. Motzkin and E. G. Straus, "Maxima for graphs and a new proof of a theorem of Turan," Canadian J. Math., vol. 17, pp. 533-540, 1965.
20. A. Nemirovskii, "Several NP-hard problems arising in robust stability analysis," Math. Control, Signals, Syst., vol. 6, no. 2, pp. 99-105, 1993.
21. R. C. L. F. Oliveira and P. L. D. Peres, "LMI conditions for the existence of polynomially parameter-dependent Lyapunov functions assuring robust stability," in Proc. 44th IEEE Conf. Decision Control - Eur. Control Conf., Dec. 2005, pp. 1660-1665.
22. B. T. Polyak and E. N. Gryazina, "Stability domain in the parameter space: D-decomposition revisited," Automatica, vol. 42, pp. 13-26, 2006.
23. S. Poljak and J. Rohn, "Checking robust nonsingularity is NP-hard," Math. Control, Signals, Syst., vol. 6, no. 1, pp. 1-9, 1993.
24. C. B. Soh, "Schur stability of convex combinations of matrices," Lin. Algebra Appl., vol. 128, pp. 159-168, 1990.
25. C. W. Scherer, "Relaxations for robust linear matrix inequality problems with verifications for exactness," SIAM J. Matrix Analy. Appl., vol. 27, no. 2, pp. 365-395, 2005.
26. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.
27. P. Tsiotras and P.-A. Bliman, "An exact stability analysis test for single-parameter polynomially-dependent linear systems," in Proc. 43rd IEEE Conf. Decision Control, Dec. 2004, pp. 1337-1340.
28. L. G. Valiant, "Completeness classes in algebra," in Proc. 11th Annu. ACM Symp. Theory Comput., Atlanta, Ga., 1979, pp. 249-261.
29. Q. G.Wang, "Necessary and sufficient conditions for stability of a matrix politope with normal vertex matrices," Automatica, vol. 27, no. 5, pp. 887-888, 1991.