A computational algorithm for the super-optimal solution of the model matching problem (Q1109729): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6911(88)90060-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985801207 / rank | |||
Normal rank | |||
Revision as of 23:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational algorithm for the super-optimal solution of the model matching problem |
scientific article |
Statements
A computational algorithm for the super-optimal solution of the model matching problem (English)
0 references
1988
0 references
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.
0 references
algorithm
0 references
model matching
0 references
robust controller design
0 references
weighted sensitivity minimization
0 references
\(H^{\infty }\)-optimization
0 references
