Randomized algorithms for robust control analysis and synthesis have polynomial complexity
- 24 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 3470-3475
- https://doi.org/10.1109/cdc.1996.573700
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Worst-case and average
H 2 performance analysis against real constant parametric uncertaintyAutomatica, 1995 - Heuristics, rules of thumb, and the 80/20 propositionIEEE Transactions on Automatic Control, 1994
- Several NP-hard problems arising in robust stability analysisMathematics of Control, Signals, and Systems, 1993
- Checking robust nonsingularity is NP-hardMathematics of Control, Signals, and Systems, 1993
- The complex structured singular valueAutomatica, 1993
- Random walks in a convex body and an improved volume algorithmRandom Structures & Algorithms, 1993
- Covariance averaging in the analysis of uncertain systemsIEEE Transactions on Automatic Control, 1993
- Stochastic robustness of linear time-invariant control systemsIEEE Transactions on Automatic Control, 1991