Model Reduction Using Semidefinite Programming
In this thesis model reduction methods for linear time invariant systems are investigated. The reduced models are computed using semidefinite programming. Two ways of imposing the stability constraint are considered. However, both approaches add a positivity constraint to the program. The input to the algorithms is a number of frequency response samples of the original model. This makes the comput