Two algorithms for one-dimensional multimodai minimization
From MaRDI portal
Cited in
(16)- Fitting three-parameter lognormal models by numerical global optimization - an improved algorithm
- Axiomatic characterization of a global optimization algorithm and investigation of its search strategy
- Extended univariate algorithms for n-dimensional global optimization
- Convergence of one-dimensional one-stage algorithms for multiextremal optimization in the presence of noise
- Convergence qualification of adaptive partition algorithms in global optimization
- Global optimization based on a statistical model and simplicial partitioning.
- Experiments with new stochastic global optimization search techniques
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
- On similarities between two models of global optimization: Statistical models and radial basis functions
- A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise
- Small sample estimation of parameters for Wiener process with noise
- On the convergence of adaptive partition algorithms in global optimization
- Axiomatic approach to statistical models and their use in multimodal optimization theory
- A statistical model for global optimization by means of select and clone
- Optimal learning with a local parametric belief model
- One-dimensional global optimization for observations with noise
This page was built for publication: Two algorithms for one-dimensional multimodai minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3921003)
