Probabilistic search algorithms for robust stability analysis and their complexity properties

Authors
Khargonekar, PP Tikku, A
Citation
Pp. Khargonekar et A. Tikku, Probabilistic search algorithms for robust stability analysis and their complexity properties, LECT N CONT, 241, 1999, pp. 25-45
Citations number
26
Categorie Soggetti
Current Book Contents
Journal title
LEARNING, CONTROL AND HYBRID SYSTEMS → ACNP
ISSN journal
01708643
Volume
241
Year of publication
1999
Pages
25 - 45
Database
ISI
SICI code
0170-8643(1999)241:<25:PSAFRS>2.0.ZU;2-P
Abstract
In this paper, we consider several robust control analysis and design probl ems. As has become well known over the last few years, most of these proble ms are NP hard. We show that if instead of worst-case guaranteed conclusion s, one is willing to draw conclusions with a high degree of confidence, the n the computational complexity decreases dramatically.