Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization
From MaRDI portal
Publication:6074062
DOI10.1007/s11081-022-09740-5OpenAlexW4294275587MaRDI QIDQ6074062
Jianyuan Zhai, Fani Boukouvala
Publication date: 18 September 2023
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-022-09740-5
Gaussian processbranch-and-boundmachine learningsupport vector regressionblack-box optimizationsurrogates
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Efficient global optimization of expensive black-box functions
- Global optimization by multilevel coordinate search
- Lipschitzian optimization without the Lipschitz constant
- Optimization of black-box problems using Smolyak grids and polynomial approximations
- Deterministic global optimization with artificial neural networks embedded
- A polyhedral branch-and-cut approach to global optimization
- UOBYQA: unconstrained optimization by quadratic approximation
- A taxonomy of global optimization methods based on response surfaces
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Practical selection of SVM parameters and noise estimation for SVM regression
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- A method for convex black-box integer global optimization
- Surrogate optimization of deep neural networks for groundwater predictions
- Deterministic global optimization with Gaussian processes embedded
- GOPS: efficient RBF surrogate global optimization algorithm with high dimensions and many parallel processors including application to multimodal water quality PDE model calibration
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
- Obey validity limits of data-driven models through topological data analysis and one-class classification
- An empirical study of derivative-free-optimization algorithms for targeted black-box attacks in deep neural networks
- Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques
- Deterministic global derivative-free optimization of black-box problems with bounded Hessian
- A surrogate-based cooperative optimization framework for computationally expensive black-box problems
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Dynamic improvements of static surrogates in direct search optimization
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- On the Convergence of Pattern Search Algorithms
- Introduction to Derivative-Free Optimization
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Feature Article—Genetic Algorithms for the Operations Researcher
- Pattern Search Algorithms for Bound Constrained Minimization
- An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A Simplex Method for Function Minimization
- Simulation optimization: a review of algorithms and applications
- Two decades of blackbox optimization applications
This page was built for publication: Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization