Methods to compare expensive stochastic optimization algorithms with random restarts
From MaRDI portal
Recommendations
- Stochastic comparison algorithm for continuous optimization with estimation
- Theoretical framework for comparing several stochastic optimization approaches
- Best practices for comparing optimization algorithms
- Stochastic Comparison Algorithm for Discrete Optimization with Estimation
- Design and Analysis of Optimization Algorithms Using Computational Statistics
Cites work
- scientific article; zbMATH DE number 3691091 (Why is no real title available?)
- scientific article; zbMATH DE number 708500 (Why is no real title available?)
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Best practices for comparing optimization algorithms
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Efficient multi-start strategies for local search algorithms
- Efficient optimization of the likelihood function in Gaussian process modelling
- Handbook of Research on Modern Optimization Algorithms and Applications in Engineering and Economics
- Introduction to Stochastic Search and Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- NOMAD
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- Optimization of convex functions with random pursuit
- Optimizing horizontal alignment of roads in a specified corridor
- Some asymptotic theory for the bootstrap
Cited in
(11)- Stochastic comparison algorithm for continuous optimization with estimation
- Deep statistical comparison for meta-heuristic stochastic optimization algorithms
- A novel statistical approach for comparing meta-heuristic stochastic optimization algorithms according to the distribution of solutions in the search space
- Improving the flexibility and robustness of model-based derivative-free optimization solvers
- Theoretical framework for comparing several stochastic optimization approaches
- Matching stochastic algorithms to objective function landscapes
- Benchmarking deterministic optimization algorithms using an outranking approach
- Mean-performance of sharp restart: II. Inequality roadmap
- Mean-based Borda count for paradox-free comparisons of optimization algorithms
- Best practices for comparing optimization algorithms
- Escaping local minima with local derivative-free methods: a numerical investigation
This page was built for publication: Methods to compare expensive stochastic optimization algorithms with random restarts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756805)
