Global OptimizationIt is a branch of applied mathematics and numerical analysis that attempts to find the minimum or maximum of a function on a given set. It is often described as a minimization problem, since the maximization of real-valued functions can be derived by analogy with minimization.

The difference between global optimization and local optimization is that the former focuses on finding the extremum on a given set, rather than finding the local extremum. Using classical local optimization methods, it is relatively easy to find any local minimum, but it is relatively difficult to find the global minimum of a function. Most analytical methods are not applicable, and using numerical solution strategies will bring great challenges.