Efficiency of a Global Optimization Algorithm

DOI10.1137/0724078zbMath0636.65060OpenAlexW2076347266MaRDI QIDQ3776516

H. Ratschek, Jon G. Rokne

Publication date: 1987

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0724078

zbMATH Keywords

global optimizationbranch-and-bound algorithmupper boundsinterval analysislower boundsinclusion functionsconvergence order

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Related Items

Arbitrarily Slow Convergence of Sequences of Linear Operators: A Survey, The convergence speed of interval methods for global optimization, A new interval method for locating the boundary of level sets, Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions, What can interval analysis do for global optimization?, The impact of accelerating tools on the interval subdivision algorithm for global optimization, Interval tools for global optimization