A new expected-improvement algorithm for continuous minimax optimization
From MaRDI portal
Publication:280101
DOI10.1007/s10898-015-0344-xzbMath1345.90105OpenAlexW1018941212MaRDI QIDQ280101
Julien Marzat, Hélène Piet-Lahanier, Éric Walter
Publication date: 29 April 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0344-x
Related Items (6)
A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty ⋮ Particle swarm metaheuristics for robust optimisation with implementation uncertainty ⋮ Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming ⋮ A sampling criterion for constrained Bayesian optimization with uncertainties ⋮ Bayesian Optimization of Expected Quadratic Loss for Multiresponse Computer Experiments with Internal Noise ⋮ Expected improvement for expensive optimization: a review
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequential design of computer experiments for the estimation of a probability of failure
- An informational approach to the global optimization of expensive-to-evaluate functions
- Convergence properties of the expected improvement algorithm with fixed mean and covariance functions
- An algorithm for the global optimization of a class of continuous minimax problems
- Robust optimization - a comprehensive survey
- A versatile stochastic model of a function of unknown and time varying form
- Efficient global optimization of expensive black-box functions
- Lipschitzian optimization without the Lipschitz constant
- The design and analysis of computer experiments.
- A taxonomy of global optimization methods based on response surfaces
- Minimax and applications
- Simultaneous Kriging-based estimation and optimization of mean response
- Worst-case global optimization of black-box functions through Kriging and relaxation
- Global optimization of stochastic black-box systems via sequential kriging meta-models
- Theory and Applications of Robust Optimization
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- Convergence rates of efficient global optimization algorithms
- Design and Analysis of Experiments, Second Edition
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
This page was built for publication: A new expected-improvement algorithm for continuous minimax optimization
