Abstract
The tensor product (TP) model transformation is an emerging technique for the ongoing system analysis and design works of recent years, where its integration with the linear matrix inequalities (LMIs)-based methods can be powerful solution. However, one of the main issues is encountered that the performance of the LMI conditions depends heavily on the tightness of the TP models. This brief proposes an efficient TP model reshaping algorithm toward tightening TP models. A novel index is introduced to quantize the tightness of TP models such that an optimal reshaping can be realized. Besides, a random search following a recursive reshaping strategy is developed, which intensively enhances the efficiency of the reshaping process. The efficiency and effectiveness of the algorithm are demonstrated via a series of numerical simulations.
Original language | English |
---|---|
Article number | 7814272 |
Pages (from-to) | 1187-1191 |
Number of pages | 5 |
Journal | IEEE Transactions on Circuits and Systems II: Express Briefs |
Volume | 64 |
Issue number | 10 |
DOIs | |
Publication status | Published - Oct 2017 |
Keywords
- Conservativeness reduction
- linear matrix inequalities (LMIs)
- polytopic models
- tensor product (TP) model transformation