Chapter 8: Random Search Methods

Adam B. Levy · Society for Industrial and Applied Mathematics eBooks · 2022

Random search methods use probability in some way to generate trial points and determine next guesses. These methods can often be simple to implement, and they are especially useful for global optimization. Like direct search methods, random search methods typically do not rely on derivative calculations, and only require determinations of function evaluations as better or worse.

Read the paper · More papers on PaperTik