Chapter 13: Deterministic Global Optimization
Sergiy I. Butenko, Pãnos M. Pardalos · Society for Industrial and Applied Mathematics eBooks · 2017
13.1 ▪ Introduction Global optimization is a branch of mathematical optimization concerned with finding global optima of nonconvex, multiextremal problems. A typical global optimization problem has numerous local optima that are not global, which makes finding a globally optimal solution extremely difficult. In its most general form, it may involve a highly nonlinear, nonsmooth, difficult-to-evaluate objective function and nonconvex feasible region, with both continuous and discrete variables.