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

确定性与随机无导数全局optimization算法的广泛数值基准研究

An extensive numerical benchmark study of deterministic vs. stochastic derivative-free global optimization algorithms

Linas Stripinis, Remigijus Paulavičius

摘要:

无导数全局优化的研究正在积极发展,今天有许多解决方案。因此,以前的和新兴的算法的实验比较必须保持最新。本文考虑了有界约束的、可能是黑箱的全局最优化问题的求解。它比较了64个无导数确定性算法对经典和国家的最先进的随机求解器。在确定性的,一个特别强调的是直接型,在那里,近年来,取得了重大进展。一组由著名的GKLS生成器生成的800个测试问题和397个来自DIRECTGOLib v1.2集合的传统测试问题被用于计算研究。超过239400求解器运行进行,需要超过531天的单CPU时间来完成它们。已经发现,确定性算法在GKLS型和低维问题上表现出色,而随机算法在高维问题上表现得更有效。

英文摘要:

Research in derivative-free global optimization is under active development, and many solution techniques are available today. Therefore, the experimental comparison of previous and emerging algorithms must be kept up to date. This paper considers the solution to the bound-constrained, possibly black-box global optimization problem. It compares 64 derivative-free deterministic algorithms against classic and state-of-the-art stochastic solvers. Among deterministic ones, a particular emphasis is on DIRECT-type, where, in recent years, significant progress has been made. A set of 800 test problems generated by the well-known GKLS generator and 397 traditional test problems from DIRECTGOLib v1.2 collection are utilized in a computational study. More than 239400 solver runs were carried out, requiring more than 531 days of single CPU time to complete them. It has been found that deterministic algorithms perform excellently on GKLS-type and low-dimensional problems, while stochastic algorithms have shown to be more efficient in higher dimensions.

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

↑