Global optimization of expensive black box problems with a known lower bound
From MaRDI portal
Publication:367162
DOI10.1007/S10898-011-9834-7zbMATH Open1277.90098OpenAlexW1972653858MaRDI QIDQ367162FDOQ367162
Publication date: 26 September 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9834-7
Recommendations
- Deterministic global derivative-free optimization of black-box problems with bounded Hessian
- Efficient global optimization of expensive black-box functions
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
- A cover partitioning method for bound constrained global optimization
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
Cites Work
- Efficient global optimization of expensive black-box functions
- Algorithm 778: L-BFGS-B
- A taxonomy of global optimization methods based on response surfaces
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Constrained global optimization of expensive black box functions using radial basis functions
- A radial basis function method for global optimization
- Parallel radial basis function methods for the global optimization of expensive functions
- A Model Reference Adaptive Search Method for Global Optimization
- A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
- A method for simulation based optimization using radial basis functions
- Improved strategies for radial basis function methods for global optimization
- A wide class of test functions for global optimization
- An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization
Cited In (7)
- Kriging-based unconstrained global optimization through multi-point sampling
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives
- MSO: a framework for bound-constrained black-box global optimization algorithms
- A kriging-based constrained global optimization algorithm for expensive black-box functions with infeasible initial points
- Surrogate‐based methods for black‐box optimization
- An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems
Uses Software
This page was built for publication: Global optimization of expensive black box problems with a known lower bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367162)
