A. Nemirovskii, SEVERAL NP-HARD PROBLEMS ARISING IN ROBUST STABILITY ANALYSIS, MCSS. Mathematics of control, signals and systems, 6(2), 1993, pp. 99-105
Citations number
3
Categorie Soggetti
Controlo Theory & Cybernetics","Engineering, Eletrical & Electronic",Mathematics,"Robotics & Automatic Control
We demonstrate that it is NP-hard to check whether all representatives
of a square interval matrix share any of the following four propertie
s: positive semidefiniteness, provided that the matrix is symmetric; n
orm less than or equal to 1; nonsingularity (NP-hardness of this parti
cular problem was established recently by Poljak and Rohn); or stabili
ty (all eigenvalues in the open left half-plane).