说明：  求多维函数极值的一种算法,由Nelder和Mead提出,又叫单纯形算法,但和线性规划中的单纯形算法是不同的,由于未利用任何
(An algorithm for finding the extremum of multidimensional functions, proposed by Nelder and Mead, is also called simplex algorithm, but is different from the simplex algorithm in linear programming.)