By Topic

Randomized algorithms for robust control analysis and synthesis have polynomial complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
P. Khargonekar ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; A. Tikku

We consider several robust control analysis and design problems. As has become well known over the last few years, most of these problems are NP hard. We show that if instead of worst-case guaranteed conclusions, one is willing to draw conclusions with a high degree of confidence, then the computational complexity decreases dramatically

Published in:

Decision and Control, 1996., Proceedings of the 35th IEEE Conference on  (Volume:3 )

Date of Conference:

11-13 Dec 1996