Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization
From MaRDI portal
Publication:6074062
Recommendations
- Surrogate‐based methods for black‐box optimization
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
- Quantifying uncertainty with ensembles of surrogates for blackbox optimization
- Optimization of black-box problems using Smolyak grids and polynomial approximations
- A survey on direct search methods for blackbox optimization and their applications
Cites work
- scientific article; zbMATH DE number 1304261 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A Simplex Method for Function Minimization
- A branch-and-reduce approach to global optimization
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- A method for convex black-box integer global optimization
- A polyhedral branch-and-cut approach to global optimization
- A surrogate-based cooperative optimization framework for computationally expensive black-box problems
- A taxonomy of global optimization methods based on response surfaces
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
- An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
- An empirical study of derivative-free-optimization algorithms for targeted black-box attacks in deep neural networks
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
- 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 Gaussian processes embedded
- Deterministic global optimization with artificial neural networks embedded
- Dynamic improvements of static surrogates in direct search optimization
- Efficient global optimization of expensive black-box functions
- Feature Article—Genetic Algorithms for the Operations Researcher
- GOPS: efficient RBF surrogate global optimization algorithm with high dimensions and many parallel processors including application to multimodal water quality PDE model calibration
- 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
- Introduction to Derivative-Free Optimization
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Lipschitzian optimization without the Lipschitz constant
- Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Obey validity limits of data-driven models through topological data analysis and one-class classification
- On the Convergence of Pattern Search Algorithms
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimization by simulated annealing
- Optimization of black-box problems using Smolyak grids and polynomial approximations
- Pattern Search Algorithms for Bound Constrained Minimization
- Practical selection of SVM parameters and noise estimation for SVM regression
- Surrogate optimization of deep neural networks for groundwater predictions
- Two decades of blackbox optimization applications
- UOBYQA: unconstrained optimization by quadratic approximation
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(2)
This page was built for publication: Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074062)
