.png){kind=icon}
.png){kind=icon}
Return
An Efficient Algorithm for Optimally Reshaping the TP Model Transformation
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2017.2651881.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Conservativeness reduction
linear matrix inequalities (LMIs)
polytopic models
tensor product (TP) model transformation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W