Blackbox: A procedure for parallel optimization of expensive black-box functions
classification
💻 cs.MS
math.OC
keywords
procedurefunctionsblack-boxexpensiveparallelresponsesamplingused
read the original abstract
This note provides a description of a procedure that is designed to efficiently optimize expensive black-box functions. It uses the response surface methodology by incorporating radial basis functions as the response model. A simple method based on a Latin hypercube is used for initial sampling. A modified version of CORS algorithm with space rescaling is used for the subsequent sampling. The procedure is able to scale on multicore processors by performing multiple function evaluations in parallel. The source code of the procedure is written in Python.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Reducing the upper bound for the Borsuk number in $\mathbb{R}^4$ to 8
Explicit partitions of variants of the truncated Lassak cover establish b(4) ≤ 8.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.