A heuristic rejection criterion in interval global optimization algorithms

DOI10.1023/A:1021991817955MaRDI QIDQ5960908zbMATH OpenFDO

Authors L. G. Casado, I. García, Tibor Csendes

Publication date 19 September 2002

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1021991817955

zbMATH Keywords

branch-and-bound algorithmglobal optimizationinclusion functioninterval arithmeticnumerical examples

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Heuristic rejection in interval global optimization
• New subinterval selection criteria for interval global optimization
• Theoretical justification of a heuristic subbox selection criterion for interval global optimization
• Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
• What can interval analysis do for global optimization?

Cited in

(7)

• Heuristic rejection in interval global optimization
• Combining interval branch and bound and stochastic search
• New interval methods for constrained global optimization
• 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
• New subinterval selection criteria for interval 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960908)