摘要
本文讨论了用直接法求解连续函数f(x)的最优化问题,给出了一个适用搜索算法,并与经典单纯形算法进行比较,验证适用搜索算法具有较好的收敛性,计算速度明显提高.
The simplex search algorithm is reviewed and some of its shortcoming are highlighted particularly, the fixed search parameters are sure liability and an improvement is proposed. An adaptive search algorithm is substituted for the set of fixed rules usually to modify the simplex. This modification abates the numbers of one-dimension-search and needs only one parameter.
关键词
函数
无约束最优化
搜索算法
unconstrained optimization
simplex algorithm
