Computational complexity of μ calculation
Authors:
- R.P. BraatzRBR.P. Braatz
- P.M. YoungPYP.M. Young
- J.C. DoyleJDJ.C. Doyle
- M. MorariMMM. Morari
- 1 May 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 39 (5) , 1000-1002
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Structured singular values and stability analysis of uncertain polynomials, Part 2: a missing linkSystems & Control Letters, 1994
- Continuity properties of the real/complex structured singular valueIEEE Transactions on Automatic Control, 1993
- Checking robust nonsingularity is NP-hardMathematics of Control, Signals, and Systems, 1993
- The Componentwise Distance to the Nearest Singular MatrixSIAM Journal on Matrix Analysis and Applications, 1992
- Quadratic programming is in NPInformation Processing Letters, 1990
- Some NP-complete problems in quadratic and nonlinear programmingMathematical Programming, 1987
- Analysis of feedback systems with structured uncertaintiesIEE Proceedings D Control Theory and Applications, 1982