Parametrized model reduction based on semidefinite programming
Artikel i vetenskaplig tidskrift, 2013

A parametrized model in addition to the control and state-space variables depends on time-independent design parameters, which essentially define a family of models. The goal of parametrized model reduction is to approximate this family of models. In this paper, a reduction method for linear time-invariant (LTI) parametrized models is presented, which constitutes the development of a recently proposed reduction approach. Reduced order models are computed based on the finite number of frequency response samples of the full order model. This method uses a semidefinite relaxation, while enforcing stability on the re- duced order model for all values of parameters of interest. As a main theoretical statement, the relaxation gap (the ratio between upper and lower bounds) is derived, which validates the relaxation. The proposed method is flexible in adding extra constraints (e.g., passivity can be enforced on reduced order models) and modifying the objective function (e.g., frequency weights can be added to the minimization criterion). The performance of the method is validated on a numerical example.


Aivar Sootla

Imperial College London

Kin Cheong Sou

Göteborgs universitet

Chalmers, Matematiska vetenskaper, Matematik

Anders Rantzer

Lunds universitet


0005-1098 (ISSN)

Vol. 49 9 2840-2844


Informations- och kommunikationsteknik





Mer information

Senast uppdaterat