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

确定性方法解决实际黑盒全局优化问题

Deterministic approaches for solving practical black-box global optimization problems

Università della Calabria(卡拉布里亚大学);Lobachevsky State University of Nizhni Novgorod(下诺夫哥罗德罗巴切夫斯基国立大学)

Dmitri E. Kvasov, Yaroslav D. Sergeyev

AI总结:

本文提出确定性方法解决多极值目标函数在约束下的全局最优问题,通过高效算法应对黑盒函数的计算挑战,验证了方法在随机测试和工程任务中的有效性。

摘要:

在许多重要设计问题中,决策需通过求解多极值目标函数的全局最优来实现,且函数常为黑盒,缺乏分析表达式且难以评估。传统优化技术基于强假设(如凸性、可微性)无法应对此类问题,而基于自然和进化启发的元启发式方法也因多极值特性难以保证成功。本文综述了作者开发的创新确定性方法,用于构造数值方法解决上述问题,并在随机测试问题和实际工程任务中展示了其效率。

英文摘要:

In many important design problems, some decisions should be made by finding the global optimum of a multiextremal objective function subject to a set of constrains. Frequently, especially in engineering applications, the functions involved in optimization process are black-box with unknown analytical representations and hard to evaluate. Such computationally challenging decision-making problems often cannot be solved by traditional optimization techniques based on strong suppositions about the problem (convexity, differentiability, etc.). Nature and evolutionary inspired metaheuristics are also not always successful in finding global solutions to these problems due to their multiextremal character. In this paper, some innovative and powerful deterministic approaches developed by the authors to construct numerical methods for solving the mentioned problems are surveyed. Their efficiency is shown on solving both the classes of random test problems and some practical engineering tasks.

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

↑