Bayesian optimization of variable-size design space problems
From MaRDI portal
Publication:2245699
DOI10.1007/s11081-020-09520-zzbMath1473.90095arXiv2003.03300OpenAlexW3039503035MaRDI QIDQ2245699
Mathieu Balesdent, El-Ghazali Talbi, Loïc Brevault, Yannick Guerin, Julien Pelamatti
Publication date: 15 November 2021
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.03300
discrete variablesBayesian optimizationmixed-variable optimization problemsvariable-size design space optimization problems
Mixed integer programming (90C11) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Multiobjective Tree-Structured Parzen Estimator, Gaussian Process Regression on Nested Spaces, A general mathematical framework for constrained mixed-variable blackbox optimization problems with meta and categorical variables, Fully Bayesian Inference for Latent Variable Gaussian Process Models
Uses Software
Cites Work
- Analysis of multi-objective Kriging-based methods for constrained global optimization
- Mesh adaptive direct search algorithms for mixed variable optimization
- Efficient global optimization of expensive black-box functions
- Application of Bayesian approach to numerical methods of global and stochastic optimization
- The design and analysis of computer experiments.
- Hidden genes genetic optimization for variable-size design space problems
- Metamodels for mixed variables based on moving least squares. Application to the structural analysis of a rigid frame
- Pattern Search Algorithms for Mixed Variable Programming
- Sparse On-Line Gaussian Processes
- Kernels for Vector-Valued Functions: A Review
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Group Kernels for Gaussian Process Metamodels with Categorical Inputs
- Support Vector Machines
- An Automatic Method for Solving Discrete Programming Problems
- A Limited Memory Algorithm for Bound Constrained Optimization
- An Algorithm Model for Mixed Variable Programming
- A Simplex Method for Function Minimization
- Theory of Reproducing Kernels
- Metamodels for computer-based engineering design: Survey and recommendations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
