Numerical experiences with a new generalized subinterval selection criterion for interval global optimization

DOI10.1023/A:1023086201037zbMath1019.65038OpenAlexW299611594MaRDI QIDQ1810785

Tibor Csendes

Publication date: 9 June 2003

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023086201037

zbMATH Keywords

tablesconvergencenumerical testsinterval arithmeticglobal optimization algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30) Tables in numerical analysis (65A05)

Related Items (2)

Two acceleration mechanisms in verified global optimization ⋮ Empirical investigation of the convergence speed of inclusion functions in a global otimization context

Uses Software

• INTOPT_90

This page was built for publication: Numerical experiences with a new generalized subinterval selection criterion for interval global optimization