首页 | 本学科首页   官方微博 | 高级检索  
     


Parametrized model reduction based on semidefinite programming
Authors:Aivar Sootla  Kin Cheong Sou  Anders Rantzer
Affiliation:1. Department of Bioengineering, Imperial College London, SW72AZ, London, United Kingdom;2. Department of Mathematical Sciences, Chalmers University of Technology, Sweden;3. University of Gothenburg, SE-41296, Gothenburg, Sweden;4. Department of Automatic Control, Lund University, Box 118, SE-22100, Lund, Sweden
Abstract: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 reduced 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.
Keywords:Model reduction   Parameter-dependent linear systems   Semidefinite programming
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号