{"title":"一种约束H/sup∞/平滑优化技术","authors":"M. Fisher, J.B. Moore, K. Teo","doi":"10.1109/CDC.1989.70395","DOIUrl":null,"url":null,"abstract":"Consideration is given to a general class of constrained H/sup infinity / optimization problems, and it is shown that these problems can be approximated by a sequence of smooth optimization problems. Thus, each of the approximate problems is readily solvable by standard optimization software packages such as those available in the NAG library or IMSL library. The approach is simple in terms of mathematical content, easy to implement, and computationally efficient.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"29 6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A constrained H/sup infinity / smooth optimization technique\",\"authors\":\"M. Fisher, J.B. Moore, K. Teo\",\"doi\":\"10.1109/CDC.1989.70395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consideration is given to a general class of constrained H/sup infinity / optimization problems, and it is shown that these problems can be approximated by a sequence of smooth optimization problems. Thus, each of the approximate problems is readily solvable by standard optimization software packages such as those available in the NAG library or IMSL library. The approach is simple in terms of mathematical content, easy to implement, and computationally efficient.<<ETX>>\",\"PeriodicalId\":156565,\"journal\":{\"name\":\"Proceedings of the 28th IEEE Conference on Decision and Control,\",\"volume\":\"29 6\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 28th IEEE Conference on Decision and Control,\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1989.70395\",\"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 28th IEEE Conference on Decision and Control,","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1989.70395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A constrained H/sup infinity / smooth optimization technique
Consideration is given to a general class of constrained H/sup infinity / optimization problems, and it is shown that these problems can be approximated by a sequence of smooth optimization problems. Thus, each of the approximate problems is readily solvable by standard optimization software packages such as those available in the NAG library or IMSL library. The approach is simple in terms of mathematical content, easy to implement, and computationally efficient.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
