The convergence speed of interval methods for global optimization
From MaRDI portal
Recommendations
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Interval tools for global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- scientific article; zbMATH DE number 4066243
Cites work
- Computation of rational interval functions
- Efficiency of a Global Optimization Algorithm
- Global optimization using interval analysis - the multi-dimensional case
- scientific article; zbMATH DE number 3742519 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 3485507 (Why is no real title available?)
- scientific article; zbMATH DE number 584485 (Why is no real title available?)
- scientific article; zbMATH DE number 815479 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Testing Unconstrained Optimization Software
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
Cited in
(22)- An interval version of Shubert's iterative method for the localization of the global maximum
- Convergence rates of a global optimization algorithm
- Accelerations for a variety of global optimization methods
- A priority measure in interval methods for constrained global optimization
- A surprising approach in interval global optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- Balanced random interval arithmetic in market model estimation
- New interval methods for constrained global optimization
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context
- scientific article; zbMATH DE number 1694756 (Why is no real title available?)
- scientific article; zbMATH DE number 4066243 (Why is no real title available?)
- scientific article; zbMATH DE number 1354997 (Why is no real title available?)
- scientific article; zbMATH DE number 1057700 (Why is no real title available?)
- Improving the convergence rate of the DIRECT global optimization algorithm
- The extrapolated interval global optimization algorithm
- Lipschitz continuity and the termination of interval methods for global optimization
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Theoretical rate of convergence for interval inclusion functions
- Empirical convergence speed of inclusion functions for facility location problems
- Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems
- A fast memoryless interval-based algorithm for global optimization
This page was built for publication: The convergence speed of interval methods for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361290)