Empirical study of the improved UNIRANDI local search method
From MaRDI portal
Publication:1642808
DOI10.1007/s10100-017-0470-2zbMath1390.90591OpenAlexW2602293712MaRDI QIDQ1642808
Publication date: 15 June 2018
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-017-0470-2
Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The GLOBAL optimization method revisited
- Incorporating minimum Frobenius norm models in direct search
- Speeding up continuous GRASP
- Global optimization by multilevel coordinate search
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Genetic algorithms: Foundations and applications
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- A stochastic method for global optimization
- On the Convergence of Pattern Search Algorithms
- An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
- Benchmarking Derivative-Free Optimization Algorithms
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A Simplex Method for Function Minimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: Empirical study of the improved UNIRANDI local search method
