Abstract
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. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
