A relaxed version of Bregman's method for interval convex programming

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

引用次数: 0

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.

查看原文本刊更多论文

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

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

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

求助全文

约1分钟内获得全文求助全文

来源期刊

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

自引率

0.00%

发文量