A computational algorithm for the super-optimal solution of the model matching problem (Q1109729): Difference between revisions

We develop a computational algorithm to implement the strengthened minimization technique 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^{\infty}\)-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.