Learning Enabled Constrained Black-Box Optimization
From MaRDI portal
Publication:5153491
DOI10.1007/978-3-030-66515-9_1OpenAlexW3167563850MaRDI QIDQ5153491
A. Candelieri, Francesco Archetti, R. Perego, Bruno G. Galuzzi
Publication date: 30 September 2021
Published in: Black Box Optimization, Machine Learning, and No-Free Lunch Theorems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-66515-9_1
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained efficient global optimization with support vector machines
- A Bayesian approach to constrained single- and multi-objective optimization
- Constrained global optimization of expensive black box functions using radial basis functions
- Parallel radial basis function methods for the global optimization of expensive functions
- A probabilistic algorithm for global optimization
- Efficient global optimization of expensive black-box functions
- Stochastic adaptive search for global optimization.
- Accelerated random search for constrained global optimization assisted by radial basis function surrogates
- A unified framework for stochastic optimization
- Constrained Bayesian optimization with noisy experiments
- Bayesian optimization of pump operations in water distribution systems
- A taxonomy of global optimization methods based on response surfaces
- Gaussian process optimization with failures: classification and convergence proof
- Multi-fidelity classification using Gaussian processes: accelerating the prediction of large-scale computational models
- Multi-objective evolutionary optimization algorithms for machine learning: a recent survey
- No free lunch theorem: a review
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
- A short note on parameter approximation for von Mises-Fisher distributions: and a fast implementation of \(I_{s}(x)\)
- A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions
- A Knowledge-Gradient Policy for Sequential Information Collection
- Response Surfaces, Mixtures, and Ridge Analyses
- Handbook of Heuristics
- Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization
- Non-convex Optimization for Machine Learning
- 10.1162/153244303321897663
- Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method
- Derivative-free optimization methods
- Bayesian Optimization and Data Science
- Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
- Pitfalls and Best Practices in Algorithm Configuration
- Algorithm 829
- Multifidelity Information Fusion Algorithms for High-Dimensional Systems and Massive Data sets
- Simulation optimization: a review of algorithms and applications
This page was built for publication: Learning Enabled Constrained Black-Box Optimization