摘要
首次提出了一种松弛型的Bregman区间凸规划算法,并保证了欠松弛条件下算法的收敛性。在前面算法收敛性证明的基础上,还得到了一个松弛型的Hildreth区间规划算法。
This paper has put forward a relaxed version of Bregman' s method for interval convex programming for the first time and strictly proved it' s convergence. Based on the above convergency proving ,a relaxed version of Hildreth' s interval programming also has been presented.
出处
《重庆大学学报（自然科学版）》
EI
CAS
CSCD
1991年第2期1-7,共7页
Journal of Chongqing University
基金
国家自然科学基金
关键词
区间凸规划
算法
松驰条件
收敛性
row-action method
intervex programming
Bregman' s convex programming method
Hildreth' s interval programming method
relaxation
