{"title":"一般鲁棒控制问题的可解性条件","authors":"T. Kiyama, S. Toyora, S. Hara","doi":"10.1109/SICE.2002.1195829","DOIUrl":null,"url":null,"abstract":"This paper is concerned with the robust well-posedness problem which is an extension of a general robust control problem. We derive a new solvability condition of the problem in the form of a linear matrix inequality (LMI) condition adding a rank condition. The condition is still nonconvex due to the existence of the rank condition. However, it can be checked approximately with the alternating projection method, and the approach might be more efficient than the existing methods from the viewpoint of computation.","PeriodicalId":301855,"journal":{"name":"Proceedings of the 41st SICE Annual Conference. SICE 2002.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A solvability condition of general robust control problems\",\"authors\":\"T. Kiyama, S. Toyora, S. Hara\",\"doi\":\"10.1109/SICE.2002.1195829\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is concerned with the robust well-posedness problem which is an extension of a general robust control problem. We derive a new solvability condition of the problem in the form of a linear matrix inequality (LMI) condition adding a rank condition. The condition is still nonconvex due to the existence of the rank condition. However, it can be checked approximately with the alternating projection method, and the approach might be more efficient than the existing methods from the viewpoint of computation.\",\"PeriodicalId\":301855,\"journal\":{\"name\":\"Proceedings of the 41st SICE Annual Conference. SICE 2002.\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 41st SICE Annual Conference. SICE 2002.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SICE.2002.1195829\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 41st SICE Annual Conference. SICE 2002.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SICE.2002.1195829","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A solvability condition of general robust control problems
This paper is concerned with the robust well-posedness problem which is an extension of a general robust control problem. We derive a new solvability condition of the problem in the form of a linear matrix inequality (LMI) condition adding a rank condition. The condition is still nonconvex due to the existence of the rank condition. However, it can be checked approximately with the alternating projection method, and the approach might be more efficient than the existing methods from the viewpoint of computation.