{"title":"半无限凸规划最优解的充要条件","authors":"Changwen Zhang","doi":"10.1109/GSIS.2017.8077724","DOIUrl":null,"url":null,"abstract":"This paper investigates characterizations of semiinfinite convex programming, and obtains conditions of optimal solutions of semi-infinite convex programming by using saddle point criteria.","PeriodicalId":425920,"journal":{"name":"2017 International Conference on Grey Systems and Intelligent Services (GSIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sufficient and necessary conditions of optimal solutions of semi-infinite convex programing\",\"authors\":\"Changwen Zhang\",\"doi\":\"10.1109/GSIS.2017.8077724\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates characterizations of semiinfinite convex programming, and obtains conditions of optimal solutions of semi-infinite convex programming by using saddle point criteria.\",\"PeriodicalId\":425920,\"journal\":{\"name\":\"2017 International Conference on Grey Systems and Intelligent Services (GSIS)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Grey Systems and Intelligent Services (GSIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GSIS.2017.8077724\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Grey Systems and Intelligent Services (GSIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GSIS.2017.8077724","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Sufficient and necessary conditions of optimal solutions of semi-infinite convex programing
This paper investigates characterizations of semiinfinite convex programming, and obtains conditions of optimal solutions of semi-infinite convex programming by using saddle point criteria.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
