Improvement of pure random search in global optimization
From MaRDI portal
Publication:4521055
Recommendations
Cites work
- scientific article; zbMATH DE number 3841285 (Why is no real title available?)
- scientific article; zbMATH DE number 3524911 (Why is no real title available?)
- scientific article; zbMATH DE number 3598385 (Why is no real title available?)
- scientific article; zbMATH DE number 3612798 (Why is no real title available?)
- scientific article; zbMATH DE number 874725 (Why is no real title available?)
- A Simplex Method for Function Minimization
- A method of unconstrained global optimization
- A numerical study of some modified versions of controlled random search method for global optimization
- Global optimization algorithms for a CAD workstation
- Global optimization and stochastic differential equations
- Global optimization by controlled random search
- Optimization by simulated annealing
- Progressive global random search of continuous functions
- Pure adaptive search in global optimization
- Stochastic Methods for Global Optimization
Cited in
(7)- Continuous functions minimization by dynamic random search technique
- Empirical study of the improved UNIRANDI local search method
- A new theoretical framework for analyzing stochastic global optimization algorithms
- Random orthocenter strategy in interior search algorithm and its engineering application
- Importance of search-domain reduction in random optimization
- On benchmarking stochastic global optimization algorithms
- Pure random search with virtual extension of feasible region
This page was built for publication: Improvement of pure random search in global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521055)