Interval method for bounding level sets: Revisited and tested with global optimization problems

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)650-657
Number of pages8
JournalBIT
Volume30
Issue number4
DOIs
Publication statusPublished - Dec 1990

Fingerprint

Interval Methods
Function evaluation
Global optimization
Level Set
Global Optimization
Program processors
Optimization Problem
Evaluation Function
CPU Time
Test Problems
Standards

Keywords

  • AMS Subject Classifications: 90C30, 65K05
  • global optimization
  • Inclusion function
  • interval arithmetic
  • level set

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics
  • Software
  • Computer Graphics and Computer-Aided Design

Cite this

Interval method for bounding level sets : Revisited and tested with global optimization problems. / Csendes, T.

In: BIT, Vol. 30, No. 4, 12.1990, p. 650-657.

Research output: Contribution to journalArticle

@article{119e70f29a9a4cf1bf7dd7a1efe5865b,
title = "Interval method for bounding level sets: Revisited and tested with global optimization problems",
abstract = "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.",
keywords = "AMS Subject Classifications: 90C30, 65K05, global optimization, Inclusion function, interval arithmetic, level set",
author = "T. Csendes",
year = "1990",
month = "12",
doi = "10.1007/BF01933213",
language = "English",
volume = "30",
pages = "650--657",
journal = "BIT Numerical Mathematics",
issn = "0006-3835",
publisher = "Springer Netherlands",
number = "4",

}

TY - JOUR

T1 - Interval method for bounding level sets

T2 - Revisited and tested with global optimization problems

AU - Csendes, T.

PY - 1990/12

Y1 - 1990/12

N2 - 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.

AB - 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.

KW - AMS Subject Classifications: 90C30, 65K05

KW - global optimization

KW - Inclusion function

KW - interval arithmetic

KW - level set

UR - http://www.scopus.com/inward/record.url?scp=0006186759&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0006186759&partnerID=8YFLogxK

U2 - 10.1007/BF01933213

DO - 10.1007/BF01933213

M3 - Article

AN - SCOPUS:0006186759

VL - 30

SP - 650

EP - 657

JO - BIT Numerical Mathematics

JF - BIT Numerical Mathematics

SN - 0006-3835

IS - 4

ER -