Global optimization is a branch of operations research, applied mathematics, and numerical analysis that attempts to find the global minimum or maximum of a function or a set of functions on a given set. It is usually described as a minimization problem because the maximization of the real-valued function g ( x ) {\displaystyle g(x)} is equivalent to the minimization of the function f ( x ) := ( − 1 ) ⋅ g ( x ) {\displaystyle f(x):=(-1)\cdot g(x)} .
Global optimization is a branch of operations research, applied mathematics, and numerical analysis that attempts to find the global minimum or maximum of a function or a set of functions on a given set. It is usually described as a minimization problem because the maximization of the real-valued function g ( x ) {\displaystyle g(x)} is equivalent to the minimization of the function f ( x ) := ( − 1 ) ⋅ g ( x ) {\displaystyle f(x):=(-1)\cdot g(x)} .
Source: Wikipedia "Global optimization" · CC BY-SA 4.0
Share this article: X · Bluesky