Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
From MaRDI portal
Recommendations
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- Simulation optimization: a review and exploration in the new era of cloud computing and big data
- Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques
Cites work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A deterministic global optimization using smooth diagonal auxiliary functions
- A polyhedral branch-and-cut approach to global optimization
- A Simplex Method for Function Minimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Deterministic global derivative-free optimization of black-box problems with bounded Hessian
- Deterministic global optimization with artificial neural networks embedded
- Efficient global optimization of expensive black-box functions
- Feature Article—Genetic Algorithms for the Operations Researcher
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization by multilevel coordinate search
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- scientific article; zbMATH DE number 1304261 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Lipschitzian optimization without the Lipschitz constant
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- On the Convergence of Pattern Search Algorithms
- Optimization by simulated annealing
- Optimization of black-box problems using Smolyak grids and polynomial approximations
- Pattern Search Algorithms for Bound Constrained Minimization
- Pyomo -- optimization modeling in Python
- Scikit-learn: machine learning in Python
- Simulation-based optimization. Parametric optimization techniques and reinforcement learning
- Surrogate optimization of deep neural networks for groundwater predictions
Cited in
(6)- Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques
- Data-driven construction of convex region surrogate models
- Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization
- Efficient hybrid Bayesian optimization algorithm with adaptive expected improvement acquisition function
- Branch-and-Model: a derivative-free global optimization algorithm
- Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions
Describes a project that uses
Uses Software
This page was built for publication: Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070360)
