arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.03590math.OCcs.NAmath.NA
收藏

使用空间填充曲线和Lipschitz和Holder常数的多重估计的确定性全局optimization

Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Holder constants

Daniela Lera, Yaroslav D. Sergeyev

摘要:

本文考虑全局最优化问题$\min_{y\in S} F(y)$,其中$S$是$\Re^N$中的超区间,且$F(y)$满足利普希茨条件,Lipschitz常数未知.假设函数$F(y)$可以是多极值的,不可微的,并且作为“黑盒”给出。为了解决这个问题,提出了一种新的全局优化算法,并在理论和数值计算上进行了研究。首先,新算法利用空间填充曲线的数值逼近,将原来的多维Lipschitz问题转化为满足赫尔德条件的单变量问题。其次,该算法在每次迭代应用一种新的几何技术,从一组从零到无穷大的值中选择一些可能的Hölder常数,从而使流行的DIRECT方法中引入的思想可以用于Hölder全局优化。建立了确定性全局最优化方法的收敛条件。对数百个测试函数的数值实验表明,新算法与其直接竞争对手相比具有相当好的性能。

英文摘要:

In this paper, the global optimization problem $\min_{y\in S} F(y)$ with $S$ being a hyperinterval in $\Re^N$ and $F(y)$ satisfying the Lipschitz condition with an unknown Lipschitz constant is considered. It is supposed that the function $F(y)$ can be multiextremal, non-differentiable, and given as a `black-box'. To attack the problem, a new global optimization algorithm based on the following two ideas is proposed and studied both theoretically and numerically. First, the new algorithm uses numerical approximations to space-filling curves to reduce the original Lipschitz multi-dimensional problem to a univariate one satisfying the Hölder condition. Second, the algorithm at each iteration applies a new geometric technique working with a number of possible Hölder constants chosen from a set of values varying from zero to infinity showing so that ideas introduced in a popular DIRECT method can be used in the Hölder global optimization. Convergence conditions of the resulting deterministic global optimization method are established. Numerical experiments carried out on several hundreds of test functions show quite a promising performance of the new algorithm in comparison with its direct competitors.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑