A heuristic rejection criterion in interval global optimization algorithms
From MaRDI portal
Publication:5960908
DOI10.1023/A:1021991817955zbMath0992.65068MaRDI QIDQ5960908
Inmaculada F. García, Leocadio G. Casado, Tibor Csendes
Publication date: 19 September 2002
Published in: BIT (Search for Journal in Brave)
global optimizationbranch-and-bound algorithmnumerical examplesinterval arithmeticinclusion function
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items (6)
An efficient interval computing technique for bound-constrained uncertain optimization problems ⋮ A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure ⋮ Heuristic rejection in interval global optimization ⋮ Combining interval branch and bound and stochastic search ⋮ New interval methods for constrained global optimization ⋮ Lipschitz continuity and the termination of interval methods for global optimization
This page was built for publication: A heuristic rejection criterion in interval global optimization algorithms
