SEVERAL NP-HARD PROBLEMS ARISING IN ROBUST STABILITY ANALYSIS

Authors
Citation
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
ISSN journal
09324194
Volume
6
Issue
2
Year of publication
1993
Pages
99 - 105
Database
ISI
SICI code
0932-4194(1993)6:2<99:SNPAIR>2.0.ZU;2-V
Abstract
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).