SEVERAL NP-HARD PROBLEMS ARISING IN ROBUST STABILITY ANALYSIS

被引：173

作者：

NEMIROVSKII, A

机构：

[1] Central Economic and Mathematical Institute, Russian Academy of Sciences, Moscow, 117418

来源：

MATHEMATICS OF CONTROL SIGNALS AND SYSTEMS | 1993年 / 6卷 / 02期

关键词：

INTERVAL MATRICES; NP-HARDNESS; ROBUST STABILITY;

D O I：

10.1007/BF01211741

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We demonstrate that it is NP-hard to check whether all representatives of a square interval matrix share any of the following four properties: positive semidefiniteness, provided that the matrix is symmetric; norm less than or equal to 1; nonsingularity (NP-hardness of this particular problem was established recently by Poljak and Rohn); or stability (all eigenvalues in the open left half-plane).

引用

页码：99 / 105

页数：7