区间凸规划的Bregman方法的一个简化版本

1992 14th Annual International Conference of the IEEE Engineering in Medicine and Biology Society Pub Date : 1992-10-01 DOI:10.1109/IEMBS.1992.590528

He Xingbai, Zhou Shouchang

{"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}

引用次数: 0

摘要

给出了Bregman区间凸规划方法的一个松弛版本。结果表明，在适当选择松弛参数的情况下，松弛过程保持了Bregman算法的收敛性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

1992 14th Annual International Conference of the IEEE Engineering in Medicine and Biology Society

自引率

0.00%

发文量