Abstract
The relaxation method of [1, Theorem 2.2] has been used in various studies to deal with parameterized linear matrix inequalities (PLMIs) without excessively increasing computational complexity. Inspired by this point, this paper proposes an improved relaxation method that can further reduce the conservatism of [1, Theorem 2.2] despite no additional slack variables, as well as reduce the number of LMIs (and LMI rows). To be specific, the reduction of both conservatism and computational complexity is verified through the well-known stabilization problems of both continuous-time and discrete-time T-S fuzzy systems, which shows the potential of the proposed method for its extension to other PLMI-based stabilization conditions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
