On computational complexity of invalidating structured uncertainty models
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 804558 (Why is no real title available?)
- A time-domain approach to model validation
- Checking robust nonsingularity is NP-hard
- Computational complexity of μ calculation
- Frequency-domain tests for validation of linear fractional uncertain models
- Linear Matrix Inequalities in System and Control Theory
- Model validation: a connection between robust control and identification
- Reducibility among combinatorial problems
- Robust performance against time-varying structured perturbations
- Robust stability with time-varying structured uncertainty
- Several NP-hard problems arising in robust stability analysis
- Some NP-complete problems in quadratic and nonlinear programming
- Structured singular values with nondiagonal structures. I. Characterizations
- The complex structured singular value
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
- Time domain identification for robust control
- Validation of linear fractional uncertain models: solutions via matrix inequalities
Cited in
(3)
This page was built for publication: On computational complexity of invalidating structured uncertainty models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128693)