By Topic

Effective diagonalization strategies for the solution of a class of optimal design problems

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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)
He, L. ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; Polak, E.

It is shown that it is possible to obtain optimal diagonalization strategies for the discretization of semiinfinite minimax optimal design problems. Both exact and approximate methods for the computation of these optimal diagonalization strategies are proposed. The algorithms for computing approximate diagonalization strategies yield very good approximations in much less computing time than needed to compute an optimal diagonalization strategy exactly. The proposed diagonalization strategies can be implemented by using estimation schemes to obtain approximations to the various quantities which determine an optimal strategy. Experimental results, involving the solution of optimal loop-shaping problems for multivariable linear feedback systems, show that the use of these implementable strategies leads to considerable savings in computer time over alternative approaches

Published in:

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