Randomized algorithms for a certain real μ computation problem

Proceedings of the American Control Conference

Volumn 5, Issue , 1998, Pages 2824-2828

  Yoon, Albert ^a   Khargonekar, Pramod P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; COMPUTATION PROBLEMS; COMPUTATION TIME; NP-HARD; RANDOM SEARCH ALGORITHM; RANDOMIZED ALGORITHMS;

LINEAR PROGRAMMING;

LEARNING ALGORITHMS;

EID: 4544343730     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.1998.688370     Document Type: Conference Paper

References (11)

1. R. Braatz, P. Young, J. Doyle, and M. Morari. Computational complexity of μ calculation. In Proceedings of the American Control Conference, pages 1682-1683, San Francisco, California, 1993.
2. Q. Duan, S. Sorooshian, and V. Gupta. Effective and efficient global optimization for conceptual rainfall-runoff models. Water Resources Research, 28(4): 1015-1031, 1992.
3. P. Khargonekar and A. Tikku. Randomized algorithms for robust control analysis and synthesis have polynomial complexity. In Proceedings of the 35th IEEE International Conference on Decision and Control, pages 3470-3475, Kobe, Japan, 1996.
4. C. Marrison and R. Stengel. The use of random search and genetic algorithms to optimize stochastic robustness functions. In Proceedings of American Control Conference, pages 1484-1489, Baltimore, Maryland, 1994.
5. J. A. Neider and R. Mead. A simplex method for function minimization. Computer Journal, 7:308-313, 1965.
6. M. P. Newlin. Model Validation, Control, and Computation. PhD thesis, California Institute of Technology, 1996.
7. M. P. Newlin and P. M. Young. Mixed μ problems and branch and bound techniques. In Proceedings of the 31st IEEE International Conference on Decision and Control, pages 3175-3180, Tucson, Arizona, 1992.
8. L. Ray and R. Stengel. Stochastic robustness of linear time-invariant control systems. IEEE Transactions on Automatic Control, 36:82-87, 1991.
9. C. R. Reeves. Modern heuristic techniques for combinatorial problems. Halsted Press, New York, 1993.
10. A. Yoon and P. Khargonekar. Compuational experiments for robust analysis. In Proceedings of the Conference on Decision and Control, pages 3560-3565, San Diego, California, 1997.
11. X. Zhu, Y. Huang, and J. Doyle. Genetic algorithms and simulated annealing for robustness analysis. In Proceedings of the American Control Conference, pages 3756-3760, Albuquerque, New Mexico, 1997.