Several NP-hard problems arising in robust stability analysis
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 733109
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
- Checking robust nonsingularity is NP-hard
- Complexity of some linear problems with interval data
- scientific article; zbMATH DE number 1187206
Cites work
Cited in
(80)- Two numerical methods for optimizing matrix stability
- LMI relaxations in robust control
- A randomized approximation algorithm for the minimal-norm static-output-feedback problem
- Eigenvectors of interval matrices over max--plus algebra
- Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
- A randomized algorithm for optimal PID controllers
- Interval Linear Algebra and Computational Complexity
- Polytopic uncertainty for linear systems: new and old complexity results
- Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach
- A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value
- Robust stability of neural network control systems with interval matrix uncertainties
- A pair of matrices sharing common Lyapunov solutions--A closer look
- Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices
- On the generation of random stable polynomials
- On application of the ray-shooting method for LQR via static-output-feedback
- Randomized algorithms for robust controller synthesis using statistical learning theory: a tutorial overview
- Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis
- A characterization of all the static stabilizing controllers for LTI systems
- Linear interval parametric approach to testing pseudoconvexity
- Guaranteed analysis and optimisation of parametric systems with application to their stability degree
- Positivity and linear matrix inequalities
- Static output feedback -- a survey
- Testing pseudoconvexity via interval computation
- Hard problems in linear control theory: possible approaches to their solution
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- Qualitative stability of linear systems
- A characterization of convex cones of matrices with constant regular inertia
- On computational complexity of invalidating structured uncertainty models
- On the complexity of the robust stability problem for linear parameter varying systems
- Checking robust nonsingularity is NP-hard
- Frequency‐domain optimization of fixed‐structure controllers
- Inversion error, condition number, and approximate inverses of uncertain matrices
- Minimal-norm static feedbacks using dissipative Hamiltonian matrices
- On distributional robustness of systems with complex uncertainty
- A survey of computational complexity results in systems and control
- Distance to the loss of structural properties for linear systems under parametric uncertainties
- Checking robust nonsingularity of tridiagonal matrices in linear time
- On a new generalised LMI condition and randomised algorithm for robust stabilisation via static-output-feedback
- Complexity issues for the symmetric interval eigenvalue problem
- The boundedness of all products of a pair of matrices is undecidable
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
- Fast linear iterations for distributed averaging
- Large-scale and global maximization of the distance to instability
- A randomised algorithm for computing static-output-feedbacks for large-scale systems
- Mixed robustness: analysis of systems with uncertain deterministic and random parameters by the example of linear systems
- On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods
- On nonsingularity of a polytope of matrices
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
- Establishing stability and instability of matrix hypercubes
- Probabilistic solutions to some NP-hard matrix problems
- Reduced vertex set result for interval semidefinite optimization problems
- The P-matrix problem is co-NP-complete
- Generalized controlled and conditioned invariances for linear \(\omega\)-periodic discrete-time systems
- The minimal realization problem in the max-plus semiring and Pisot's problem are NP-hard
- Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control
- A probabilistic framework for problems with real structured uncertainty in systems and control
- Robust stability using interval analysis
- Large-scale minimization of the pseudospectral abscissa
- Complexity issues in robust stability of linear delay-differential systems
- Stochastic algorithms for robustness of control performances
- Nonsmooth optimization method for \(H_\infty\) output feedback control
- Randomized algorithms for robust controller synthesis using statistical learning theory
- A resilience optimization approach for workforce-inventory control dynamics under uncertainty
- On the stability of a convex set of matrices
- scientific article; zbMATH DE number 733109 (Why is no real title available?)
- NP-hardness of the stable matrix in unit interval family problem in discrete time
- A survey of randomized algorithms for control synthesis and performance verification
- scientific article; zbMATH DE number 4200064 (Why is no real title available?)
- Enclosure of all index-1 saddle points of general nonlinear functions
- On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability
- Computational complexity reduction in scaled \({\mathcal H}_ \infty\) synthesis
- Event-triggered \(\varepsilon\) level \(H_ \infty\) probabilistic control of uncertain systems
- Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
- Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- On the complexity of detecting convexity over a box
- A new vertex result for robustness problems with interval matrix uncertainty
- Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
- Robust α -exponential estimate for polytopic uncertain positive discrete-time systems with bounded time-varying delay
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
This page was built for publication: Several NP-hard problems arising in robust stability analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312298)
