Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints (SHEBO) v1.0
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
SHEBO (surrogate optimization of problems with hidden constraints and expensive black-box objectives) is an efficient optimization algorithm that employs surrogate models to solve computationally expensive black-box simulation optimization problems that have hidden constraints. Hidden constraints are encountered when the objective function evaluation does not return a value for a parameter vector. These constraints are often encountered in optimization problems in which the objective function is computed by a black-box simulation code. SHEBO uses a combination of local and global search strategies together with an evaluability prediction function and a dynamically adjusted evaluability threshold to iteratively select new sample points.
- Short Name / Acronym:
- SHEBO v1.0
- Site Accession Number:
- 2020-002
- Software Type:
- Scientific
- License(s):
- BSD 3-clause "New" or "Revised" License
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOEPrimary Award/Contract Number:AC02-05CH11231
- DOE Contract Number:
- AC02-05CH11231
- Code ID:
- 31296
- OSTI ID:
- code-31296
- Country of Origin:
- United States
Similar Records
MISO - Mixed Integer Surrogate Optimization