Addressing mixed constraints: an improved framework for black-box optimization

DOI10.1007/S10898-025-01486-5MaRDI QIDQ6939956zbMATH OpenFDO

Authors N. S. Upadhye

Publication date 20 August 2025

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

Full work available at URL https://doi.org/10.1007/S10898-025-01486-5

zbMATH Keywords

black-box functionexpected improvementGaussian process

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Bayesian inference (62F15) Derivative-free methods and methods using generalized derivatives (90C56)

Cites work

• Bayesian optimization
• Bayesian Optimization Via Barrier Functions
• Bayesian Optimization via Exact Penalty
• Constrained Bayesian Optimization with Lower Confidence Bound
• Constrained Bayesian optimization with noisy experiments
• Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions
• Design and analysis of simulation experiments
• Efficient global optimization of expensive black-box functions
• Expected improvement for expensive optimization: a review
• Gaussian processes for machine learning.
• scientific article; zbMATH DE number 7164723 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Introduction to Derivative-Free Optimization
• Scikit-learn: machine learning in Python

This page was built for publication: Addressing mixed constraints: an improved framework for black-box optimization

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