By Topic

Sensitivity shaping with degree constraint via convex optimization

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
$31 $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

3 Author(s)
Takyar, M.S. ; Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN ; Amini, A.N. ; Georgiou, T.T.

We present an approach for shaping closed-loop operators while keeping their Mcmillan degree bounded by the sum of unstable plant-poles and non-minimum phase plant-zeros. We make use of recent developments in analytic interpolation with degree constraint and we focus on the paradigm of sensitivity minimization. The sensitivity function can be obtained as the minimizer of a convex weighted-entropy functional. It is the choice of this weight that we formulate as a convex optimization problem in this paper

Published in:

American Control Conference, 2006

Date of Conference:

14-16 June 2006