Probabilistic search algorithms for robust stability analysis and their complexity properties

DOI10.1007/BFb0109719zbMath0923.93045OpenAlexW172260396MaRDI QIDQ4227144

Pramod P. Khargonekar, Ashok Tikku

Publication date: 19 October 1999

Published in: Learning, control and hybrid systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0109719

zbMATH Keywords

computational complexityrandom search algorithmsrobust stability analysisNP hard problems\(\mu\) analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Robust stability (93D09) Stochastic learning and adaptive control (93E35)

Related Items (1)

Randomized algorithms for robust controller synthesis using statistical learning theory: a tutorial overview

This page was built for publication: Probabilistic search algorithms for robust stability analysis and their complexity properties