Stochastic Optimization
Stochastic optimization refers to the minimization (or maximization) of a function in the presence of randomness in the optimization process. The randomness may be present as either noise in measurements or Monte Carlo randomness in the search procedure, or both.
Common methods of stochastic optimization include direct search methods (such as the Nelder-Mead method), stochastic approximation, stochastic programming, and miscellaneous methods such as simulated annealing and genetic algorithms.
See also
Genetic Algorithm, Nelder-Mead Method, Optimization Theory, Robbins-Monro Stochastic Approximation, Simulated AnnealingExplore with Wolfram|Alpha
WolframAlpha
More things to try:
Cite this as:
Weisstein, Eric W. "Stochastic Optimization." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/StochasticOptimization.html