Computational algorithms based on random search for solving global optimization problems
From MaRDI portal
Publication:4009752
Recommendations
Cites work
Cited in
(16)- scientific article; zbMATH DE number 3941278 (Why is no real title available?)
- Improvement of pure random search in global optimization
- Performance of global random search algorithms for large dimensions
- scientific article; zbMATH DE number 3920191 (Why is no real title available?)
- scientific article; zbMATH DE number 4100970 (Why is no real title available?)
- Empirical study of the improved UNIRANDI local search method
- A random search approach to finding the global minimum
- Randomized algorithms in interval global optimization
- scientific article; zbMATH DE number 4104377 (Why is no real title available?)
- Random search optimization approach for highly multi-modal nonlinear problems
- A linear constrained optimization Benchmark for probabilistic search algorithms: the rotated Klee-Minty problem
- Asymptotic matching and genetic optimization applied to optimal aerospace design
- scientific article; zbMATH DE number 5061888 (Why is no real title available?)
- A heuristic approach for finding the global minimum: Adaptive random search technique
- scientific article; zbMATH DE number 2099379 (Why is no real title available?)
- Modified random-to-pattern search algorithm (mrps) for global ptimization
This page was built for publication: Computational algorithms based on random search for solving global optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009752)