{"title":"在降阶H∞控制下求解BMI的非凸谱算法","authors":"Ye Shi, Hoang Duong Tuan, Steven W. Su","doi":"10.1109/ICCSCE.2016.7893591","DOIUrl":null,"url":null,"abstract":"The design of reduced-order H∞ control can be transformed into an optimization problem with bilinear matrix inequality (BMI) constraints, which is an NP-hard problem. We propose a method to equivalently transfer the BMI constraint into a convex LMI constraint plus a matrix-rank constraint. The optimization with matrix-rank constraint is iteratively solved by a sequence of semidefinite programming (SDP) problems. Simulations on several benchmark systems show that our algorithm is practical and efficient.","PeriodicalId":6540,"journal":{"name":"2016 6th IEEE International Conference on Control System, Computing and Engineering (ICCSCE)","volume":"23 1","pages":"316-319"},"PeriodicalIF":0.0000,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nonconvex spectral algorithm for solving BMI on the reduced order H∞ control\",\"authors\":\"Ye Shi, Hoang Duong Tuan, Steven W. Su\",\"doi\":\"10.1109/ICCSCE.2016.7893591\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The design of reduced-order H∞ control can be transformed into an optimization problem with bilinear matrix inequality (BMI) constraints, which is an NP-hard problem. We propose a method to equivalently transfer the BMI constraint into a convex LMI constraint plus a matrix-rank constraint. The optimization with matrix-rank constraint is iteratively solved by a sequence of semidefinite programming (SDP) problems. Simulations on several benchmark systems show that our algorithm is practical and efficient.\",\"PeriodicalId\":6540,\"journal\":{\"name\":\"2016 6th IEEE International Conference on Control System, Computing and Engineering (ICCSCE)\",\"volume\":\"23 1\",\"pages\":\"316-319\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 6th IEEE International Conference on Control System, Computing and Engineering (ICCSCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSCE.2016.7893591\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 6th IEEE International Conference on Control System, Computing and Engineering (ICCSCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSCE.2016.7893591","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Nonconvex spectral algorithm for solving BMI on the reduced order H∞ control
The design of reduced-order H∞ control can be transformed into an optimization problem with bilinear matrix inequality (BMI) constraints, which is an NP-hard problem. We propose a method to equivalently transfer the BMI constraint into a convex LMI constraint plus a matrix-rank constraint. The optimization with matrix-rank constraint is iteratively solved by a sequence of semidefinite programming (SDP) problems. Simulations on several benchmark systems show that our algorithm is practical and efficient.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
