A computational algorithm for the super-optimal solution of the model matching problem |
| |
| Affiliation: | 1. Laboratoire de Chimie Bio-inspirée et d''Innovations Ecologiques, ChimEco, UMR 5021 CNRS – UM, Cap Delta, 1682 Rue de la Valsière, 34790 Grabels, France;2. Institut Européen des Membranes, UMR 5635, CC 047, Place Eugène Bataillon, 34095 Montpellier, France;3. Institut Charles Gerhardt de Montpellier, UMR 5253 CNRS-UM-ENSCM, Université de Montpellier, Place E. Bataillon, Bât 17, CC 1701, 34095 Montpellier, France;1. Shien-Ming Wu School of Intelligent Engineering, South China University of Technology, Guangzhou, 511442, PR China;2. School of Civil Engineering, Chongqing University, Chongqing, 400044, PR China;1. Lappeenranta-Lahti University of Technology LUT, P.O. Box 20, FI-53851, Lappeenranta, Finland;2. VTT Technical Research Centre of Finland Ltd, P.O. Box 1000, FI-02044, VTT, Finland |
| |
| Abstract: | In this paper, we develop a computational algorithm to implement the strengthened minimization technique 1] in the model matching problem which arises in robust controller design and weighted sensitivity minimization.A general algorithm is proposed for constructing unitary matrices and the extremal functions for the H∞-optimization problem are diagonalized using the constructed unitary matrices. We impose stronger minimization conditions to force the solution of the optimization problem to be unique and explain their physical significance. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
