一种改进的一维搜索指数优化算法

An Improved Exponential Optimization Algorithm of One-Dimensional Search

在分析黄金分割法基本原理的基础上,通过改变以指数收敛的区间长度缩短比率得到一种新的一维搜索指数优化算法.实例结果表明:该算法的收敛速度要比黄金分割法的收敛速度要快,同时最优解的区间精度也比黄金分割法的要精确;然而,该算法只适用于单峰函数局部最优解的求取.

Based on the analysis of the basic principle of the golden section method,a new method called exponential optimization algorithm for one-dimensional search was presented by changing the interval length ratio of the exponential convergence.The results show that the method has faster convergence rate than that of the golden section method and the precision interval of the optimal solutions are also better than that of the golden section method.However,this algorithm applies only to calculate the local optimal solution of one-humped function.