Empirical investigation of the convergence speed of inclusion functions in a global otimization context
From MaRDI portal
Publication:2572918
DOI10.1007/s11155-005-6890-zzbMath1078.65547OpenAlexW2073222661MaRDI QIDQ2572918
Tibor Csendes, Boglárka G.-Tóth
Publication date: 7 November 2005
Published in: Reliable Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11155-005-6890-z
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items (12)
On interval branch-and-bound for additively separable functions with common variables ⋮ Empirical convergence speed of inclusion functions for facility location problems ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure ⋮ The theoretical and empirical rate of convergence for geometric branch-and-bound methods ⋮ Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods ⋮ A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms ⋮ Obtaining an outer approximation of the efficient set of nonlinear biobjective problems ⋮ The GLOBAL optimization method revisited ⋮ Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models ⋮ Theoretical rate of convergence for interval inclusion functions ⋮ A computationally inexpensive algorithm for determining outer and inner enclosures of nonlinear mappings of ellipsoidal domains
Uses Software
Cites Work
- Optimal centered forms
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
- Computation and application of Taylor polynomials with interval remainder bounds
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- Numerical experiences with a new generalized subinterval selection criterion for interval global optimization
- Taylor forms -- use and limits.
- On an efficient use of gradient information for accelerating interval global optimization algorithms
- A new inclusion function for optimization: kite -- the one-dimensional case
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Empirical investigation of the convergence speed of inclusion functions in a global otimization context
