Computational experiments in robust stability analysis

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.

[1]  Pramod P. Khargonekar,et al.  Randomized algorithms for robust control analysis and synthesis have polynomial complexity , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[2]  Soroosh Sorooshian,et al.  Optimal use of the SCE-UA global optimization method for calibrating watershed models , 1994 .

[3]  A. Nemirovskii.  Several NP-hard problems arising in robust stability analysis , 1993 .

[4]  R. Tempo,et al.  Probabilistic robustness analysis: explicit bounds for the minimum number of samples , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[5]  Pramod P. Khargonekar,et al.  Design of computer experiments for open-loop control and robustness analysis of clutch-to-clutch shifts in automatic transmissions , 1997, Proceedings of the 1997 American Control Conference (Cat. No.97CH36041).

[6]  R. Stengel,et al.  Technical notes and correspondence: Stochastic robustness of linear time-invariant control systems , 1991 .

[7]  M. Safonov,et al.  Exact calculation of the multiloop stability margin , 1988 .

[8]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[9]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[10]  M. J. D. Powell,et al.  An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..

[11]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[12]  Xiaoyun Zhu,et al.  Genetic algorithms and simulated annealing for robustness analysis , 1997, Proceedings of the 1997 American Control Conference (Cat. No.97CH36041).

[13]  B. Barmish,et al.  Maximal unidirectional perturbation bounds for stability of polynomials and matrices , 1988 .

[14]  P.M. Young,et al.  Mixed mu problems and branch and bound techniques , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.