Efficient global optimization of expensive black-box functions

被引:5172
|
作者
Jones, DR [1 ]
Schonlau, M
Welch, WJ
机构
[1] GM Corp, R&D Operat, Dept Operat Res, Warren, MI 48090 USA
[2] Natl Inst Stat Sci, Res Triangle Pk, NC USA
[3] Univ Waterloo, Dept Stat & Actuarial Sci, Waterloo, ON N2L 3G1, Canada
[4] Univ Waterloo, Inst Improvement Qual & Product, Waterloo, ON N2L 3G1, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Bayesian global optimization; kriging; random function; response surface; stochastic process; visualization;
D O I
10.1023/A:1008306431147
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In many engineering optimization problems, the number of function evaluations is severely limited by time or cost. These problems pose a special challenge to the field of global optimization, since existing methods often require more function evaluations than can be comfortably afforded. One way to address this challenge is to fit response surfaces to data collected by evaluating the objective and constraint functions at a few points. These surfaces can then be used for visualization, tradeoff analysis, and optimization. In this paper, we introduce the reader to a response surface methodology that is especially good at modeling the nonlinear, multimodal functions that often occur in engineering. We then show how these approximating functions can be used to construct an efficient global optimization algorithm with a credible stopping rule. The key to using response surfaces for global optimization Lies in balancing the need to exploit the approximating surface (by sampling where it is minimized) with the need to improve the approximation (by sampling where prediction error may be high). Striking this balance requires solving certain auxiliary problems which have previously been considered intractable, but we show how these computational obstacles can be overcome.
引用
收藏
页码:455 / 492
页数:38
相关论文
共 50 条
  • [1] Efficient Global Optimization of Expensive Black-Box Functions
    Donald R. Jones
    Matthias Schonlau
    William J. Welch
    Journal of Global Optimization, 1998, 13 : 455 - 492
  • [2] Safe global optimization of expensive noisy black-box functions in the δ-Lipschitz framework
    Sergeyev, Yaroslav D.
    Candelieri, Antonio
    Kvasov, Dmitri E.
    Perego, Riccardo
    SOFT COMPUTING, 2020, 24 (23) : 17715 - 17735
  • [3] Enhanced surrogate assisted framework for constrained global optimization of expensive black-box functions
    Carpio, Roymel R.
    Giordano, Roberto C.
    Secchi, Argimiro R.
    COMPUTERS & CHEMICAL ENGINEERING, 2018, 118 : 91 - 102
  • [4] Mode-pursuing sampling method for global optimization on expensive black-box functions
    Wang, LQ
    Shan, SQ
    Wang, GG
    ENGINEERING OPTIMIZATION, 2004, 36 (04) : 419 - 438
  • [5] MACHINE-LEARNING IN OPTIMIZATION OF EXPENSIVE BLACK-BOX FUNCTIONS
    Tenne, Yoel
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2017, 27 (01) : 105 - 118
  • [6] Predictive Entropy Search for Efficient Global Optimization of Black-box Functions
    Hernandez-Lobato, Jose Miguel
    Hoffman, Matthew W.
    Ghahramani, Zoubin
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 27 (NIPS 2014), 2014, 27
  • [7] AN EMPIRICAL REVIEW OF MODEL-BASED ADAPTIVE SAMPLING FOR GLOBAL OPTIMIZATION OF EXPENSIVE BLACK-BOX FUNCTIONS
    Nezami, Nazanin
    Anahideh, Hadis
    2022 WINTER SIMULATION CONFERENCE (WSC), 2022, : 3182 - 3193
  • [8] Variable-fidelity probability of improvement method for efficient global optimization of expensive black-box problems
    Ruan, Xiongfeng
    Jiang, Ping
    Zhou, Qi
    Hu, Jiexiang
    Shu, Leshi
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2020, 62 (06) : 3021 - 3052
  • [9] Variable-fidelity probability of improvement method for efficient global optimization of expensive black-box problems
    Xiongfeng Ruan
    Ping Jiang
    Qi Zhou
    Jiexiang Hu
    Leshi Shu
    Structural and Multidisciplinary Optimization, 2020, 62 : 3021 - 3052
  • [10] An efficient global optimization algorithm for expensive constrained black-box problems by reducing candidate infilling region
    Zeng, Yong
    Cheng, Yuansheng
    Liu, Jun
    INFORMATION SCIENCES, 2022, 609 : 1641 - 1669