摘要
本文提出了一种求解无约束全局优化解的新方法——缩小区间法。解决了二个问题。(一)当目标函数满足Lipschitzian条件时,可逐次缩小区间而不致漏掉全局优化解,显著减少了计算时间。(二)当目标函数不存在Linschitzian条件时,进行一定的反代逐次近似缩小区间计算,也能找到全局优化解,文中附有算例。
A new approach,domain decreasing appoach for solving unconstrained global optimization problems is put forward.When the goal function satisfy the Lischitzian condition.the global optimum can be obtained by decreasing the searching domain step by step without losing the real solutions When the Lipschitzian condition is not satisfyed,theglobal optimum and decreasing the searching domain step by step.Some examples is provided in this paper.
出处
《淮北煤师院学报(自然科学版)》
1995年第4期20-24,共5页
Journal of Huaibei Teachers College(Natural Sciences Edition)