全局优化中的子域可分性
Subdomain Separability in Global Optimization
AI总结:
本文提出全局优化中可分性的推广,利用伴随算法微分的区间导数自动验证结构分隔子,以缩减搜索空间并加速优化方法。
摘要:
我们提出了一种在全局优化背景下对可分性的推广。我们的结果适用于以可微计算机程序实现的目标函数,并在一种简单的分支定界方法中加以阐述。通常显著的搜索空间缩减可预期加速任何全局优化方法。我们展示了如何利用由伴随算法微分计算的区间导数来考察目标函数关于所谓结构分隔子的单调性,以及如何自动验证后者。
英文摘要:
We propose a generalization of separability in the context of global optimization. Our results apply to objective functions implemented as differentiable computer programs. They are presented in the context of a simple branch and bound method. The often significant search space reduction can be expected to yield an acceleration of any global optimization method. We show how to utilize interval derivatives calculated by adjoint algorithmic differentiation to examine the monotonicity of the objective with respect to so called structural separators and how to verify the latter automatically.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。