NP-hardness of some linear control design problems

SIAM Journal on Control and Optimization

Volumn 35, Issue 6, 1997, Pages 2118-2127

  Blondel, Vincent ^a   Tsitsiklis, John N ^b  

^a UNIVERSITY OF LIÈGE   (Belgium)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Complexity; Control design; Linear control

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONTROL SYSTEM SYNTHESIS; DECENTRALIZED CONTROL; FEEDBACK CONTROL; MATRIX ALGEBRA; PROBLEM SOLVING; SYSTEM STABILITY;

LINEAR CONTROL DESIGN;

LINEAR CONTROL SYSTEMS;

EID: 0031272805     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0363012994272630     Document Type: Article

References (17)

1. B. D. O. ANDERSON, N. K. BOSE, AND E. I. JURY, Output feedback stabilization and related problems - solutions via decision methods, IEEE Trans. Automat. Control, 20 (1975), pp. 53-66.
2. S. BASU, R. POLLACK, AND M.-F. ROY, On the combinatorial and algebraic complexity of quantifier elimination, J. Assoc. Comput. Mach. 43 (1996), pp. 1002-1046.
3. D. S. BERNSTEIN, Some open problems in matrix theory arising in linear systems and control, Linear Algebra Appl., (1992), pp. 409-432.
4. V. BLONDEL, Simultaneous Stabilization of Linear Systems, Lecture Notes in Control and Inform. Sci. 191 (1994), Springer-Verlag, London.
5. V. BLONDEL, M. GEVERS, AND A. LINDQUIST, Survey on the state of systems and control, European J. Control, 1 (1995), pp. 5-23.
6. R. BRAATZ, P. YOUNG, J. DOYLE, AND M. MORARI, Computational complexity of mu calculation, IEEE Trans. Automat. Control, 39 (1994), pp. 1000-1002.
7. G. E. COXSON AND C. L. DEMARCO, The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix, Math. Control Signals Systems, 7 (1994), pp. 279-291.
8. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman, New York, 1979.
9. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
10. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-103.
11. A. NEMIROVSKII, Several NP-hard problems arising in robust stability analysis, Math. Control Signals Systems, 6 (1993), pp. 99-105.
12. M. OVERTON, Personal communication, 1994.
13. C. H. PAPADIMITRIOU AND K. STIEGLITZ, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
14. S. POLJAK AND J. ROHN, Checking robust nonsingularity is NP-hard, Math. Control Signals Systems, 6 (1993), pp. 1-9.
15. J. N. TSITSIKLIS, Complexity Theoretic Aspects of Problems in Control Theory, Technical Report LIDS-P-2203, Laboratory for Information and Decision Systems, MIT, Cambridge, MA, 1993.
16. M. VIDYASAGAR, Control System Synthesis, MIT Press, Cambridge, MA, 1986.
17. W. M. WONHAM, Linear Multivariable Control: A Geometric Approach, Springer-Verlag, New York, 1979.