On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability

DOI10.1109/TAC.2008.2007177zbMath1367.93463OpenAlexW2082158259MaRDI QIDQ4974461

Leonid Gurvits, Alexander Olshevsky

Publication date: 8 August 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2008.2007177

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Discrete event control/observation systems (93C65) Robust stability (93D09) Eigenvalues, singular values, and eigenvectors (15A18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes ⋮ Polytopic uncertainty for linear systems: new and old complexity results ⋮ Stability of matrix polytopes with a dominant vertex and implications for system dynamics ⋮ High-order maximum principles for the stability analysis of positive bilinear control systems

This page was built for publication: On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability