INTERVAL METHOD FOR BOUNDING LEVEL SETS - REVISITED AND TESTED WITH GLOBAL OPTIMIZATION PROBLEMS

被引:6
作者
CSENDES, T [1 ]
机构
[1] JOZSEF ATTILA UNIV,KALMAR LAB CYBERNET,H-6720 SZEGED,HUNGARY
来源
BIT | 1990年 / 30卷 / 04期
关键词
INCLUSION FUNCTION; INTERVAL ARITHMETIC; LEVEL SET; GLOBAL OPTIMIZATION;
D O I
10.1007/BF01933213
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
An interval method for bounding level sets, modified to increase its efficiency and to get sharper bounding boxes, is presented. The new algorithm was tested with standard global optimization test problems. The test results show that, while the modified method gives a more valuable, guaranteed reliability result set, it is competitive with non-interval methods in terms of CPU time and number of function evaluations.
引用
收藏
页码:650 / 657
页数:8
相关论文
共 10 条