The Nelder-Mead simplex method is an optimization routine that works well with irregular objective functions. For a function of <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$n$$</EquationSource> </InlineEquation> parameters, it compares the objective function at the <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$n+1$$</EquationSource> </InlineEquation> vertices of a simplex and updates the worst vertex through simplex search steps. However, a...</equationsource></inlineequation></equationsource></inlineequation>