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

DOI10.1109/TAC.2008.2007177MaRDI QIDQ4974461zbMATH OpenOpenAlexFDO

Authors Leonid Gurvits, Alex 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

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

Recommendations

• scientific article; zbMATH DE number 176450
• Stability conditions of polytopic uncertain switched linear systems with simultaneously diagonalizable vertex matrices
• Determining the viability of a polytope for a switched system
• Several NP-hard problems arising in robust stability analysis
• An efficient algorithm for checking the robust stability of a polytope of polynomials
• scientific article; zbMATH DE number 5811833
• On Switching Stabilizability for Continuous-Time Switched Linear Systems
• Stability of polytopic systems via convex \(M\)-matrices and parameter-dependent Lyapunov functions
• scientific article; zbMATH DE number 733109
• Analysis and Verification of Input-to-State Stability for Nonautonomous Discrete-Time Switched Systems via Semidefinite Programming

Cited in

(7)

• Stability of matrix polytopes with a dominant vertex and implications for system dynamics
• Polytopic uncertainty for linear systems: new and old complexity results
• High-order maximum principles for the stability analysis of positive bilinear control systems
• Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
• How do the lengths of switching intervals influence the stability of a dynamical system?
• Schur stability of matrix segment via bialternate product
• Second-order linear switching systems with arbitrary control sets: stability and invariant norms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974461)