Recommendations
Cites work
- A Sequential Method Seeking the Global Maximum of a Function
- An algorithm for finding the absolute extremum of a function
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Customizing methods for global optimization -- a geometric viewpoint
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
- scientific article; zbMATH DE number 3628741 (Why is no real title available?)
- Improving hit-and-run for global optimization
- Iterative Methods for the Localization of the Global Maximum
- Minimization by Random Search Techniques
- Multidimensional bisection applied to global optimisation
- On adaptive and non-adaptive stochastic and deterministic algorithms
- Pure adaptive search in global optimization
- Pure adaptive search in Monte Carlo optimization
- Random homeomorphisms
- Simulated annealing for constrained global optimization
- The bisection method in higher dimensions
Cited in
(7)- Pure adaptive search in global optimization
- Hesitant adaptive search for global optimisation
- Adaptive search over sorted sets
- The robust constant and its applications in random global search for unconstrained global optimization
- A Complexity Analysis of Local Search Algorithms in Global Optimization
- scientific article; zbMATH DE number 970351 (Why is no real title available?)
- On the investigation of stochastic global optimization algorithms
This page was built for publication: Towards pure adaptive search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905968)