Several NP-hard problems arising in robust stability analysis-Reference-Cited by-同舟云学术

Several NP-hard problems arising in robust stability analysis

Published:1993-06 Issue:2 Volume:6 Page:99-105
ISSN:0932-4194
Container-title:Mathematics of Control, Signals, and Systems
language:en
Short-container-title:Math. Control Signal Systems

Author:

Nemirovskii A.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Control and Optimization,Signal Processing,Control and Systems Engineering

Link

http://link.springer.com/content/pdf/10.1007/BF01211741.pdf

Reference3 articles.

1. M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

2. V. L. Kharitonov, Asymptotic stability of an equilibrium position of a family of systems of linear differential equations,Differential Equations,14 (1979), 1483?1485.

3. S. Poljak and J. Rohn, Checking robust nonsingularity is NP-hard,Math. Control Signals Systems,6 (1993), 1?9.

Cited by 177 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Using Quantum Computers In Control: Interval Matrix Properties;2024 European Control Conference (ECC);2024-06-25

2. LMI-Based Robustness Analysis In Uncertain Systems;Foundations and Trends® in Systems and Control;2024

3. Computational Complexity of Decomposing a Symmetric Matrix as a Sum of Positive Semidefinite and Diagonal Matrices;Foundations of Computational Mathematics;2023-12-08

4. On real structured controllability/stabilizability/stability radius: Complexity and unified rank-relaxation based methods;Systems & Control Letters;2023-08

5. Distance to the loss of structural properties for linear systems under parametric uncertainties;Journal of the Franklin Institute;2023-08