一种利用光滑对角辅助函数的确定性全局优化
A deterministic global optimization using smooth diagonal auxiliary functions
AI总结:
本文提出一种确定性'分最佳'算法,用于解决目标函数及其梯度均为黑盒函数的全局优化问题,通过高效的对角分区和光滑辅助函数实现收敛性分析与数值实验。
摘要:
在许多实际决策问题中,优化过程中涉及的函数通常是黑盒函数,具有未知的解析表达式且难以评估。本文考虑了一个全局优化问题,其中目标函数$f(x)$及其梯度$f'(x)$均为黑盒函数。假设$f'(x)$在搜索超区间内满足利普希茨条件,但未知的利普希茨常数$K$。本文提出了一种基于高效对角分区和光滑辅助函数的新确定性'分最佳'算法,研究了其收敛条件,并在八百个测试函数上进行了数值实验。
英文摘要:
In many practical decision-making problems it happens that functions involved in optimization process are black-box with unknown analytical representations and hard to evaluate. In this paper, a global optimization problem is considered where both the goal function~$f(x)$ and its gradient $f'(x)$ are black-box functions. It is supposed that $f'(x)$ satisfies the Lipschitz condition over the search hyperinterval with an unknown Lipschitz constant~$K$. A new deterministic `Divide-the-Best' algorithm based on efficient diagonal partitions and smooth auxiliary functions is proposed in its basic version, its convergence conditions are studied and numerical experiments executed on eight hundred test functions are presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。