Interval method for bounding level sets: Revisited and tested with global optimization problems (Q804239)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Interval method for bounding level sets: Revisited and tested with global optimization problems |
scientific article; zbMATH DE number 4199501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interval method for bounding level sets: Revisited and tested with global optimization problems |
scientific article; zbMATH DE number 4199501 |
Statements
Interval method for bounding level sets: Revisited and tested with global optimization problems (English)
0 references
1990
0 references
The author modifies his algorithm [Computing 41, No.1/2, 75-86 (1989; Zbl 0665.65099)] for bounding the level sets of nonlinear functions. The modifications increase the efficiency of the algorithm which is illustrated by several test problems from global optimization.
0 references
inclusion function
0 references
interval arithmetic
0 references
bounds for level sets
0 references
algorithm
0 references
test problems
0 references
global optimization
0 references
0.9242753
0 references
0.8996059
0 references
0.89254695
0 references
0.88587964
0 references
0.88536394
0 references
0.88358545
0 references
0.8805924
0 references
