Computational Experiments Using Randomized Algorithms for Robust Stability Analysis (0)
| Citations: | 1 - 0 self |
BibTeX
@MISC{Yoon_computationalexperiments,
author = {Albert Yoon and Pramod Khargonekar},
title = {Computational Experiments Using Randomized Algorithms for Robust Stability Analysis},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we take a "computational experiments" approach to robust stability analysis problems. Many robust control problems have been shown to be NP hard but in spite of this, it is important to develop effective techniques for solving them. A typical robust stability analysis problem is taken and formulated as an optimization problem to which several optimization algorithms are applied. Key words: randomized algorithms, global optimization, robust stability analysis, real parametric uncertainty 1 Introduction In the last few years, it has become increasingly clear that the problem of robust stability analysis (even for linear time-invariant finite dimensional control systems) is extremely difficult to tackle analytically. This appears to be even more so for the case of real parameter uncertainty. Results on computational complexity [5,14] of robust stability analysis provide strong support for such conclusions. The fundamental underlying reason appears to be the fact that th...
