Voronoi candidates for Bayesian optimization

DOI10.1007/S10898-025-01574-6MaRDI QIDQ6851196zbMATH OpenFDO

Authors Nathan Wycoff, John W. jun. Smith, Annie S. Booth, Robert B. Gramacy

Publication date 27 February 2026

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

Full work available at URL https://doi.org/10.1007/S10898-025-01574-6

zbMATH Keywords

black-boxcomputational geometryderivative-free optimizationemulatorhigh dimensionsurrogate

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• A taxonomy of global optimization methods based on response surfaces
• Active Learning for Deep Gaussian Process Surrogates
• An empirical study of Bayesian optimization: acquisition versus partition
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Bayesian optimization
• Branch and bound algorithms for maximizing expected improvement functions
• Convergence rates of efficient global optimization algorithms
• Efficient global optimization of expensive black-box functions
• Expected improvement for expensive optimization: a review
• Gaussian processes for machine learning.
• Inference for dynamic and latent variable models via iterated perturbed Bayes maps
• Iterated filtering
• Latin hypercubes and space-filling designs
• Multidimensional binary search trees used for associative searching
• Particle Markov Chain Monte Carlo Methods
• Stochastic and Integral Geometry
• The quickhull algorithm for convex hulls

This page was built for publication: Voronoi candidates for Bayesian optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851196)