Computational algorithms based on random search for solving global optimization problems
From MaRDI portal
Publication:4009752
DOI10.1080/00207169008803842zbMATH Open0752.65053OpenAlexW1971788035MaRDI QIDQ4009752FDOQ4009752
Authors: Kusum Shanker, C. Mohan
Publication date: 27 September 1992
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169008803842
Recommendations
Cites Work
Cited In (16)
- Title not available (Why is that?)
- Improvement of pure random search in global optimization
- Performance of global random search algorithms for large dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Empirical study of the improved UNIRANDI local search method
- A random search approach to finding the global minimum
- Randomized algorithms in interval global optimization
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A heuristic approach for finding the global minimum: Adaptive random search technique
- Title not available (Why is that?)
- 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)