Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/68999
DC FieldValue
dc.titleA parameter optimization approach to solving quasi-LMI problems
dc.contributor.authorZheng, F.
dc.contributor.authorWang, Q.-G.
dc.contributor.authorLee, T.H.
dc.date.accessioned2014-06-19T02:55:43Z
dc.date.available2014-06-19T02:55:43Z
dc.date.issued2001
dc.identifier.citationZheng, F.,Wang, Q.-G.,Lee, T.H. (2001). A parameter optimization approach to solving quasi-LMI problems. Proceedings of the IEEE Conference on Decision and Control 4 : 3607-3612. ScholarBank@NUS Repository.
dc.identifier.issn01912216
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/68999
dc.description.abstractMany canonical and modern control problems can be recast into the problem of solving a group of matrix inequalities. Some of them are in the form of linear matrix inequalities (LMIs), which can be solved very efficiently by the powerful LMI toolbox in Matlab, but some others are in the form of quasi LMIs (QLMIs). By quasi, we mean that unknown parameters are involved in the matrix inequalities and these inequalities are LMIs only when the unknown parameters are fixed. Thus how to "guess" the unknown parameters is the key to solve the whole problem. In this note, we present an optimal estimate for the unknown parameters. We will illustrate our method by completely solving the problems of overshoot bound control and reachable set analysis for uncertain systems. Numerical examples are provided to show the effectiveness of the proposed method.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitleProceedings of the IEEE Conference on Decision and Control
dc.description.volume4
dc.description.page3607-3612
dc.description.codenPCDCD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.