带隐藏约束昂贵黑箱问题的自适应代理优化方法

展开
  • 1. 重庆师范大学重庆国家应用数学中心, 重庆 401331
    2. 重庆师范大学数学科学学院, 重庆 401331
白富生 E-mail: fsbai@cqnu.edu.cn

收稿日期: 2021-10-11

  网络出版日期: 2024-03-16

基金资助

国家自然科学基金(11991024);国家自然科学基金(11871128);重庆市技术创新与应用发展专项重点项目(cstc2021jscx-jbgsX0001);重庆市教委科学技术研究计划重点项目(KJZD-K202114801)

版权

运筹学学报编辑部, 2024, 版权所有,未经授权。

An adaptive surrogate optimization method for expensive black-box problems with hidden constraints

Expand
  • 1. National Center for Applied Mathematics in Chongqing, Chongqing Normal University, Chongqing 401331, China
    2. School of Mathematical Sciences, Chongqing Normal University, Chongqing 401331, China

Received date: 2021-10-11

  Online published: 2024-03-16

Copyright

, 2024, All rights reserved, without authorization

摘要

针对带隐藏约束的昂贵黑箱全局优化问题, 提出采用自适应转换搜索策略的代理优化方法。在转换搜索子步中采用与已估值点个数相关的标准差在当前最优点附近通过随机扰动生成候选点, 以更好地平衡局部搜索和全局搜索。为更好地近似真实黑箱目标函数, 采用了自适应组合目标代理模型。在50个测试问题上进行了数值实验, 计算结果说明了所提算法的有效性。

本文引用格式

白富生, 兰秘 . 带隐藏约束昂贵黑箱问题的自适应代理优化方法[J]. 运筹学学报, 2024 , 28(1) : 89 -100 . DOI: 10.15960/j.cnki.issn.1007-6093.2024.01.007

Abstract

A surrogate optimization method with adaptive transition search strategy is proposed for expensive black-box problems with hidden constraints. In the sub-steps of the transition search, a variance related to the number of evaluated points is used for the generation of trial points by random perturbation to better balance the local and global searches. In order to better approximate the real black box objective function, an adaptively combined objective surrogate model is adopted. The effectiveness of the proposed algorithm is demonstrated by the results of the numerical experiments carried out on 50 test problems.

参考文献

1 Carter R G , Gablonsky J M , Patrick A , et al. Algorithms for noisy problems in gas transmission pipeline optimization[J]. Optimization and Engineering, 2001, 2 (2): 139- 157.
2 Ji C , Dames E , Wang Y L , et al. Propagation and extinction of premixed C5-C12 n-alkane flames[J]. Combustion Flame, 2010, 157 (2): 277- 287.
3 Booker A J , Dennis J E , Frank P D , et al. A rigorous framework for optimization of expensive functions by surrogates[J]. Structural Optimization, 1999, 17 (1): 1- 13.
4 Juliane M , Marcus D . Surrogate optimization of computationally expensive black-box problems with hidden constraints[J]. INFORMS Journal on Computing, 2019, 31 (4): 689- 702.
5 Myers R H , Montgomery D C . Response Surface Methodology: Process and Product Optimization Using Designed Experiments[M]. New York: Wiley, 1995.
6 Digabel S L . Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm[J]. ACM Transactions on Mathematical Software, 2011, 37 (4): 1- 15.
7 Mueller J , Shoemaker C A . Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms forcomputationally expensive black-box global optimization problems[J]. Journal of Global Optimization, 2014, 60 (2): 123- 144.
8 Gutmann H M . A radial basis function method for global optimization[J]. Journal of Global Optimization, 2001, 19 (3): 201- 227.
9 白富生, 冯丹, 张柯. 求解昂贵黑箱全局优化问题的自适应采样组合响应面方法[J]. 运筹学学报, 2021, 25 (2): 1- 14.
10 Powell M J D. The theory of radial basis function approximation in 1990[M]//Advances in Numerical Analysis, Oxford: Oxford University Press, 105-210.
11 Jie H , Wu Y , Ding J . An adaptive metamodel-based global optimization algorithm for black-box type problems[J]. Engineering Optimization, 2015, 47 (11): 1459- 1480.
12 Regis R G , Shoemaker C A . Combining radial basis function surrogates dynamic coordinate search in high dimensional expensive black-box optimization[J]. Engineering Optimzation, 2013, 45 (5): 529- 555.
13 Juliane M , Marcus D . Online supplement for Surrogate optimization of computationally expensive black-box problems with hidden constraints[J]. INFORMS Journal on Computing, 2019, 31 (4): 689- 702.
14 Dolan E D , Moré J J . Benchmarking optimization software with performance profiles[J]. Mathematical Programming, 2001, 91 (2): 201- 213.
15 Moré J J , Wild S M . Benchmarking derivative-free optimization algorithms[J]. SIAM Journal on Optimization, 2009, 20 (1): 172- 191.
文章导航

/