1) Downhill Simplex (DHS)
下山单纯形方法
2) Downhill simplex
下山单纯形
3) simplex method
单纯形方法
1.
The solution of optimal lineac programming can be greatly simplified by usingthe continual matrix primary transformation instead of the basis change and iteration in the simplex method.
将单纯形方法的换基迭代过程代之以矩阵的初等变换，从而使得线性规划最优解的求解过程大大简化。
2.
A simplex method for function minimization in optimization theory is implemented to numerical solution of dispersion relation for nonlinear dielectric waveguides.
简要介绍了优化理论中的单纯形方法 ,并且应用到求解介质非线性光波导的色散方程。
3.
According to the simplex method and long step path following algorithm(by Hertog,Roos and Terlaky 1991),we introduce an interior algorithm with combinatorial characteristic for linear programming with inequality constraints.
根据单纯形方法和大步长路径跟踪算法（Ｈｅｒｔｏｇ，Ｒｏｏｓ和Ｔｅｒｌａｋｙ１９９１），对于具有不等式约束的线性规划问题，引进了一个具有组合特性的内点算法。
5) downhill simplex method
下降单纯形法
6) Nelder-Mead simplex method
NM单纯形方法
1.
In this paper,we apply the Nelder-Mead simplex method to deal with the measurement data to get the size of the Nanoparticle based on the so-called photon correlation spectroscopy.
本文基于光子相关光谱法,对实验数据采用NM单纯形方法来获取纳米级超细颗粒粒径。
补充资料：单纯形方法
见线性规划。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条