NP-Hardness of Some Linear Control Design Problems
- 1 November 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 35 (6) , 2118-2127
- https://doi.org/10.1137/s0363012994272630
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- On the combinatorial and algebraic complexity of quantifier eliminationJournal of the ACM, 1996
- Survey on the State of Systems and ControlEuropean Journal of Control, 1995
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrixMathematics of Control, Signals, and Systems, 1994
- Computational complexity of μ calculationIEEE Transactions on Automatic Control, 1994
- Simultaneous stabilization of linear systemsPublished by Springer Nature ,1994
- Several NP-hard problems arising in robust stability analysisMathematics of Control, Signals, and Systems, 1993
- Checking robust nonsingularity is NP-hardMathematics of Control, Signals, and Systems, 1993
- Some open problems in matrix theory arising in linear systems and controlLinear Algebra and its Applications, 1992
- Output feedback stabilization and related problems-solution via decision methodsIEEE Transactions on Automatic Control, 1975