The impact of accelerating tools on the interval subdivision algorithm for global optimization
From MaRDI portal
Publication:1804056
DOI10.1016/0377-2217(93)90110-9zbMath0768.90068OpenAlexW2016196165MaRDI QIDQ1804056
Tibor Csendes, János D. Pintér
Publication date: 29 June 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90110-9
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (11)
A filled function method applied to nonsmooth constrained global optimization ⋮ The convergence speed of interval methods for global optimization ⋮ On the selection of subdivision directions in interval branch-and-bound methods for global optimization ⋮ A new interval method for locating the boundary of level sets ⋮ A continuous location model for siting a non-noxious undesirable facility within a geographical region ⋮ Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms ⋮ New filled functions for nonsmooth global optimization ⋮ New interval methods for constrained global optimization ⋮ Mathematically rigorous global optimization in floating-point arithmetic ⋮ Experiments with new stochastic global optimization search techniques ⋮ A new pruning test for finding all global minimizers of nonsmooth functions
Cites Work
- Interval method for bounding level sets: Revisited and tested with global optimization problems
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Inclusion functions and global optimization. II
- An interval method for bounding level sets of parameter estimation problems
- An interval arithmetic method for global optimization
- A stochastic method for global optimization
- Inclusion functions and global optimization
- Globally convergent methods for n-dimensional multiextremal optimization
- Efficiency of a Global Optimization Algorithm
- Some NP-complete problems in quadratic and nonlinear programming
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Global optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The impact of accelerating tools on the interval subdivision algorithm for global optimization
