A fast memoryless interval-based algorithm for global optimization
From MaRDI portal
Publication:975771
DOI10.1007/S10898-009-9472-5zbMath1190.90147OpenAlexW2032070796MaRDI QIDQ975771
Publication date: 11 June 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9472-5
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Interval branch and bound with local sampling for constrained global optimization
- Efficient interval partitioning for constrained global optimization
- A collection of test problems for constrained global optimization algorithms
- The convergence speed of interval methods for global optimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- Handbook of global optimization. Vol. 2
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- Derivative-free filter simulated annealing method for constrained continuous global optimization
- Taboo Search: An Approach to the Multiple Minima Problem
- Introduction to Interval Analysis
- Tabu Search—Part I
- An algorithm for nonconvex programming problems
- FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES
- Computation of rational interval functions
- An Algorithm for Separable Nonconvex Programming Problems
- Lipschitz continuity and the termination of interval methods for global optimization
- A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
This page was built for publication: A fast memoryless interval-based algorithm for global optimization
