# Dictionary:Global optimization

Many problems involve the search for a solution through a process that may be an iterative search for a solution vector ${\displaystyle x}$ in ${\displaystyle n}$-variables called the unknowns, through the maximization or minimization of a scalar valued function ${\displaystyle f(x)}$ called the objective function which may be subject to ${\displaystyle m}$ constraints ${\displaystyle C_{j}(x)}$ where ${\displaystyle j=1,...,m}$ which the vector of unknowns must satisfy. It is desired that the process converge sufficiently rapidly as to be economical, and that the resulting solution be sufficiently precise.