scientific article; zbMATH DE number 3612798
From MaRDI portal
Publication:4177355
Cited in
(16)- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
- Global optimization and simulated annealing
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
- Parallel algorithms for global optimization
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
- Population set-based global optimization algorithms: some modifications and numerical studies
- Global optimization for possibly time-dependent cost functions by a population set-based algorithm with births control
- A stochastic method for global optimization
- Stochastic global optimization methods part II: Multi level methods
- Improvement of pure random search in global optimization
- Modified controlled random search algorithms
- Fast hydrological model calibration based on the heterogeneous parallel computing accelerated shuffled complex evolution method
- A modification to the new version of the Price's algorithm for continuous global optimization problems
- Concurrent stochastic methods for global optimization
- A filled function method for finding a global minimizer of a function of several variables
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177355)
