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 条

[1]

[Anonymous], 1978, GLOBAL OPTIMISATION

[2] AN INTERVAL METHOD FOR BOUNDING LEVEL SETS OF PARAMETER-ESTIMATION PROBLEMS [J].

CSENDES, T .

COMPUTING, 1989, 41 (1-2) :75-86

[3]

Csendes T., 1988, Acta Cybernetica, V8, P361

[4] GLOBAL OPTIMIZATION USING INTERVAL-ANALYSIS - THE MULTIDIMENSIONAL CASE [J].

HANSEN, E .

NUMERISCHE MATHEMATIK, 1980, 34 (03) :247-270

[5]

HANSEN P, IN PRESS J MECHANISM

[6] DETERMINISTIC GLOBAL OPTIMIZATION WITH PARTITION SETS WHOSE FEASIBILITY IS NOT KNOWN - APPLICATION TO CONCAVE MINIMIZATION, REVERSE CONVEX CONSTRAINTS, DC-PROGRAMMING, AND LIPSCHITZIAN OPTIMIZATION [J].

HORST, R .

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1988, 58 (01) :11-37

[7] INCLUSION FUNCTIONS AND GLOBAL OPTIMIZATION II [J].

MOORE, RE ;

RATSCHEK, H .

MATHEMATICAL PROGRAMMING, 1988, 41 (03) :341-356

[8] EXTENDED UNIVARIATE ALGORITHMS FOR NORMAL-DIMENSIONAL GLOBAL OPTIMIZATION [J].

PINTER, J .

COMPUTING, 1986, 36 (1-2) :91-103

[9] INCLUSION FUNCTIONS AND GLOBAL OPTIMIZATION [J].

RATSCHEK, H .

MATHEMATICAL PROGRAMMING, 1985, 33 (03) :300-317

[10]

Ratschek H., 1984, COMPUTER METHODS RAN

← 1 →