Some modifications of low-dimensional simplex evolution and their convergence
From MaRDI portal
Recommendations
- Low dimensional simplex evolution: a new heuristic for global optimization
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- A metamodel-assisted evolutionary algorithm for expensive optimization
- Globally convergent evolution strategies
- An adaptive search algorithm for numerical optimization
Cites work
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- A numerical study of some modified differential evolution algorithms
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Theory of genetic algorithms. II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
This page was built for publication: Some modifications of low-dimensional simplex evolution and their convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924104)