Towards pure adaptive search

DOI10.1007/BF01100207zbMath0844.90081OpenAlexW2335608824MaRDI QIDQ1905968

W. P. Baritompa, Zelda B. Zabinsky, Zhang Baoping, Regina Hunter Mladineo, Graham R. Wood

Publication date: 8 February 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01100207

zbMATH Keywords

pure adaptive searchsomewhat adaptive search

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (4)

The robust constant and its applications in random global search for unconstrained global optimization ⋮ A Complexity Analysis of Local Search Algorithms in Global Optimization ⋮ Hesitant adaptive search for global optimisation ⋮ On the investigation of stochastic global optimization algorithms

Cites Work

• Unnamed Item
• On adaptive and non-adaptive stochastic and deterministic algorithms
• Random homeomorphisms
• Pure adaptive search in Monte Carlo optimization
• Multidimensional bisection applied to global optimisation
• Pure adaptive search in global optimization
• Global optimization of univariate Lipschitz functions. I: Survey and properties
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
• The bisection method in higher dimensions
• Simulated annealing for constrained global optimization
• Improving hit-and-run for global optimization
• Customizing methods for global optimization -- a geometric viewpoint
• An algorithm for finding the global maximum of a multimodal, multivariate function
• Iterative Methods for the Localization of the Global Maximum
• Minimization by Random Search Techniques
• An algorithm for finding the absolute extremum of a function
• A Sequential Method Seeking the Global Maximum of a Function

This page was built for publication: Towards pure adaptive search