arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.06017math.OC
收藏

全局优化 via 最优决策树

Global Optimization via Optimal Decision Trees

Dimitris Bertsimas, Berk Öztürk

AI总结:

本文提出利用带超平面的最优决策树学习全局优化问题的混合整数优化兼容近似,以高效求解含显式和黑箱约束的全局优化问题,并通过投影梯度下降改进解,在数值基准和实际设计中验证了有效性。

摘要:

全局优化文献高度重视将难以处理的优化问题转化为更易处理的结构化优化形式。为实现这一目标,许多现有方法仅限于在显式约束和目标函数上进行优化,且这些约束和目标函数仅使用部分可能的数学原语。在现实世界中,当出现更一般的显式约束和黑箱约束时,这些方法受到限制。利用混合整数优化(MIO)中显著的加速进展以及机器学习的最新研究,我们提出了一种新方法,使用带超平面的最优决策树(OCT-Hs)来学习全局优化问题的MIO兼容近似。这种约束学习方法仅需要有界变量域,并且可以处理显式和隐式约束。我们高效地求解MIO近似,以找到全局优化问题的近最优、近可行解。我们进一步通过一系列投影梯度下降迭代来改进解。我们在文献中的多个数值基准以及实际设计问题上测试了该方法,展示了其在高效寻找全局最优解方面的潜力。

英文摘要:

The global optimization literature places large emphasis on reducing intractable optimization problems into more tractable structured optimization forms. In order to achieve this goal, many existing methods are restricted to optimization over explicit constraints and objectives that use a subset of possible mathematical primitives. These are limiting in real-world contexts where more general explicit and black box constraints appear. Leveraging the dramatic speed improvements in mixed-integer optimization (MIO) and recent research in machine learning, we propose a new method to learn MIO-compatible approximations of global optimization problems using optimal decision trees with hyperplanes (OCT-Hs). This constraint learning approach only requires a bounded variable domain, and can address both explicit and inexplicit constraints. We solve the MIO approximation efficiently to find a near-optimal, near-feasible solution to the global optimization problem. We further improve the solution using a series of projected gradient descent iterations. We test the method on a number of numerical benchmarks from the literature as well as real-world design problems, demonstrating its promise in finding global optima efficiently.

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

↑