On computational complexity of invalidating structured uncertainty models

DOI10.1016/S0167-6911(97)00131-XzbMath0902.93002MaRDI QIDQ1128693

Onur Toker, Jie Chen

Publication date: 13 August 1998

Published in: Systems \& Control Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitydiscrete-time systemslinear fractional transformationmodel validationstructured uncertainty models

Mathematics Subject Classification ID

Related Items (3)

System identification for achieving robust performance ⋮ Comparing multivariable uncertain model structures for data‐driven robust control: Visualization and application to a continuously variable transmission ⋮ Probabilistic bounds for \(\ell _{1}\) uncertainty model validation

Cites Work

• Unnamed Item
• Several NP-hard problems arising in robust stability analysis
• The complex structured singular value
• Checking robust nonsingularity is NP-hard
• Time domain identification for robust control
• The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
• Some NP-complete problems in quadratic and nonlinear programming
• Model validation: a connection between robust control and identification
• A time-domain approach to model validation
• Computational complexity of μ calculation
• Robust stability with time-varying structured uncertainty
• Linear Matrix Inequalities in System and Control Theory
• Frequency-domain tests for validation of linear fractional uncertain models
• Robust performance against time-varying structured perturbations
• Validation of linear fractional uncertain models: solutions via matrix inequalities
• Reducibility among Combinatorial Problems
• Structured singular values with nondiagonal structures. I. Characterizations

This page was built for publication: On computational complexity of invalidating structured uncertainty models