 Any serious parameter optimization method should be translation invariant, but most methods do not exhibit all the above described invariance properties.A prominent example with the same invariance properties is the Nelder–Mead method, where the initial simplex must be chosen respectively.Conceptual considerations like the scale-invariance property of the algorithm, the analysis of simpler evolution strategies, and overwhelming empirical evidence suggest that the algorithm converges on a large class of functions fast to the global optimum, denoted as formula_208.