无约束优化算法：单纯形法.doc

:设是中的个点,构成一个当前的单纯形,定义如下:记为这个单纯形除去外的所有顶点的形心,取关于的反射点,构成新的单纯形,反复上述过程,直到达到停止条件。)函数语法函数输入::目标函数:迭代初始点:函数参数设置函数输出::最优点:最优点对应的函数值:函数停止信息1:函数收敛正常停止0:迭代次数,目标函数计算次数达到最大数-1:算法被输出函数停止:函数运算信息2)函数使用(1)目标函数程序函数不需要导数信息。(2)算法参数设置:(3)函数调用运算:3)计算结果Iteration Func-count  minf(x)    Procedure0      1         1      3         initialsimplex2      5         expand3      7         expand4      8         reflect5     10         contractinside6     12         contractinside7     13         reflect8     15         contractinside9     17         contractoutside10     19         contractinside11     21         contractinside12     23         contractinside13     24         reflect14     26         contractinside15     28         contractoutside16     30         expand17     32         expand18     34         expand19     36         expand20     38         expand21     39         reflect22     41         expand23     42         reflect24     44         expand25     45         reflect26     47         contractinside27     49         contractoutside28     51         expand29     53         contractinside30     55         expand31     56         reflect32     58     3.