Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Lower Bounds on the Infima in Some {cal H}_{\infty } Optimization Problems

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

2 Author(s)
Wahls, S. ; Lehrstuhl fur Theor. Informationstechnik, Tech. Univ. Milnchen, Munich, Germany ; Boche, H.

We consider three optimization problems: system inversion, model matching with probably unstable plant, and full information control. A common theme in numerical solution of these problems is that the infimal performance among solutions has to be approximated before a suboptimal solution can be found. Recently, a sequence of lower bounds that converges monotonously towards the exact infimum has been established for the system inversion problem. The goal of this technical note is twofold. First, we show that except for some rare cases these lower bounds converge at least root-exponentially fast, i.e., we establish the good-naturedness of this approximation method. Second, we show how the approximation method can be extended such that also arbitrarily good lower bounds on the infima in the model matching problem and the full information control problem can be obtained.

Published in:

Automatic Control, IEEE Transactions on  (Volume:57 ,  Issue: 3 )