The convergence speed of interval methods for global optimization

被引：8
|
作者：
Csallner, AE
Csendes, T
机构：
[1] József Attila University, Institute of Informatics, Szeged
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 1996年 / 31卷 / 4-5期
关键词：
global optimization; interval arithmetic; subdivision;
D O I：
10.1016/0898-1221(95)00229-4
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Three particular algorithms from a class of interval subdivision methods for global optimization are studied. The theoretical upper bound on the convergence speed of Hansen's method is given. The three methods (by Hansen, Moore-Skelboe, and a new one with a random actual box selection rule) are compared numerically.
引用
收藏
页码：173 / 178
页数：6
相关论文
共 50 条
12345