caa a22 4500 465821391 CHVBK 20180323112136.0 cr unu---uuuuu 170327e19901201xx s 000 0 eng 10.1007/BF01933213 doi (NATIONALLICENCE)springer-10.1007/BF01933213 Csendes Tibor Kalmár Laboratory of Cybernetics, József Attila University, Árpád tér 2, H-6720, Szeged, Hungary aut Interval method for bounding level sets: Revisited and tested with global optimization problems [Elektronische Daten] [Tibor Csendes] 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. BIT Foundations, 1990 Inclusion function nationallicence interval arithmetic nationallicence level set nationallicence global optimization nationallicence BIT Numerical Mathematics Kluwer Academic Publishers 30/4(1990-12-01), 650-657 0006-3835 30:4<650 1990 30 10543 https://doi.org/10.1007/BF01933213 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF01933213 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Csendes Tibor Kalmár Laboratory of Cybernetics, József Attila University, Árpád tér 2, H-6720, Szeged, Hungary aut NATIONALLICENCE 773 0- BIT Numerical Mathematics Kluwer Academic Publishers 30/4(1990-12-01), 650-657 0006-3835 30:4<650 1990 30 10543 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer