Efficient hybrid Bayesian optimization algorithm with adaptive expected improvement acquisition function

DOI10.1080/0305215X.2020.1826467MaRDI QIDQ6094430zbMATH OpenOpenAlexFDO

Authors Zhao-Yi Xu

Publication date 10 October 2023

Published in Engineering Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0305215x.2020.1826467

zbMATH Keywords

Gaussian process regressionadaptive samplingsimulation-based optimizationhybrid optimizationBayesian optimization

Mathematics Subject Classification ID

Bayesian inference (62F15) Applications of mathematical programming (90C90) Methods of quasi-Newton type (90C53)

Recommendations

• Simulation optimization using the cross-entropy method with optimal computing budget allocation
• An algorithm for computationally expensive engineering optimization problems
• Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method
• Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
• Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space

Cites work

• scientific article; zbMATH DE number 3909945 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• A literature survey of benchmark functions for global optimisation problems
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• A tutorial on Gaussian process regression: modelling, exploring, and exploiting functions
• Branch-and-Bound Methods: A Survey
• Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
• On the Convergence of Pattern Search Algorithms
• Practical methods of optimization.
• Simulation-based optimization. Parametric optimization techniques and reinforcement learning
• Testing statistical hypotheses. In 2 volumes
• The Euclidean traveling salesman problem is NP-complete

Cited in

(5)

• An efficient modified Hyperband and trust-region-based mode-pursuing sampling hybrid method for hyperparameter optimization
• scientific article; zbMATH DE number 5630971 (Why is no real title available?)
• Adaptive confidence bound based Bayesian optimization via potentially optimal Lipschitz conditions
• High-efficient sample point transform algorithm for large-scale complex optimization
• Using the knowledge gradient acquisition function in Bayesian optimization when searching for robust solutions

This page was built for publication: Efficient hybrid Bayesian optimization algorithm with adaptive expected improvement acquisition function

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