求多维函数极值的一种算法，由Nelder和Mead提出，又叫单纯形算法，但和线性规划中的单纯形算法是不同的，由于未利用任何求导运算，算法比较简单，但收敛速度较慢，适合变元数不是很多的方程求极值-Multi-dimensional function extremum seeking an algorithm proposed by Nelder and Mead, also called the simplex algorithm, but in the linear programming simplex algorithm is different, because not to use any derivation operator, the algorithm is relatively simple, but slow convergence, the number of variables fit the equation is not a lot of extremal