{"title":"一般H/sup∞/优化:数值建议及处理植物不确定性的方法","authors":"J. Helton, O. Merino","doi":"10.1109/CDC.1988.194545","DOIUrl":null,"url":null,"abstract":"A major part of this paper is devoted to describing numerical experience with (OPT). The authors make tentative suggestions for those who are developing computer methods for solving (OPT) or (UNCOPT') based on iterating solutions to successive A-A-K problems. Rather than focusing on a particular algorithm, the authors give qualitative properties which will be useful in studying many algorithms as well as in understanding worst case frequency-domain optimization in general.<<ETX>>","PeriodicalId":113534,"journal":{"name":"Proceedings of the 27th IEEE Conference on Decision and Control","volume":"236 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"General H/sup infinity / optimization: numerical advice and a way to treat plant uncertainty\",\"authors\":\"J. Helton, O. Merino\",\"doi\":\"10.1109/CDC.1988.194545\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A major part of this paper is devoted to describing numerical experience with (OPT). The authors make tentative suggestions for those who are developing computer methods for solving (OPT) or (UNCOPT') based on iterating solutions to successive A-A-K problems. Rather than focusing on a particular algorithm, the authors give qualitative properties which will be useful in studying many algorithms as well as in understanding worst case frequency-domain optimization in general.<<ETX>>\",\"PeriodicalId\":113534,\"journal\":{\"name\":\"Proceedings of the 27th IEEE Conference on Decision and Control\",\"volume\":\"236 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 27th IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1988.194545\",\"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 27th IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1988.194545","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
General H/sup infinity / optimization: numerical advice and a way to treat plant uncertainty
A major part of this paper is devoted to describing numerical experience with (OPT). The authors make tentative suggestions for those who are developing computer methods for solving (OPT) or (UNCOPT') based on iterating solutions to successive A-A-K problems. Rather than focusing on a particular algorithm, the authors give qualitative properties which will be useful in studying many algorithms as well as in understanding worst case frequency-domain optimization in general.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
