The convergence speed of interval methods for global optimization

A. E. Csallner, T. Csendes

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

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

Original languageEnglish
Pages (from-to)173-178
Number of pages6
JournalComputers and Mathematics with Applications
Volume31
Issue number4-5
DOIs
Publication statusPublished - 1996

Keywords

  • Global optimization
  • Interval arithmetic
  • Subdivision

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'The convergence speed of interval methods for global optimization'. Together they form a unique fingerprint.

  • Cite this