{"title":"区间凸规划的Bregman方法的一个简化版本","authors":"He Xingbai, Zhou Shouchang","doi":"10.1109/IEMBS.1992.590528","DOIUrl":null,"url":null,"abstract":"A relaxed Version of Bregman's interval convex programming method is presented. It is shown that the relaxation procedure preserved the convergence properties of Bregman' algorithm for a suitable choice of the relaxation parameters.","PeriodicalId":6457,"journal":{"name":"1992 14th Annual International Conference of the IEEE Engineering in Medicine and Biology Society","volume":"47 1","pages":"2188-2189"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A relaxed version of Bregman's method for interval convex programming\",\"authors\":\"He Xingbai, Zhou Shouchang\",\"doi\":\"10.1109/IEMBS.1992.590528\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A relaxed Version of Bregman's interval convex programming method is presented. It is shown that the relaxation procedure preserved the convergence properties of Bregman' algorithm for a suitable choice of the relaxation parameters.\",\"PeriodicalId\":6457,\"journal\":{\"name\":\"1992 14th Annual International Conference of the IEEE Engineering in Medicine and Biology Society\",\"volume\":\"47 1\",\"pages\":\"2188-2189\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1992 14th Annual International Conference of the IEEE Engineering in Medicine and Biology Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEMBS.1992.590528\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1992 14th Annual International Conference of the IEEE Engineering in Medicine and Biology Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEMBS.1992.590528","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A relaxed version of Bregman's method for interval convex programming
A relaxed Version of Bregman's interval convex programming method is presented. It is shown that the relaxation procedure preserved the convergence properties of Bregman' algorithm for a suitable choice of the relaxation parameters.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
