Abstract
A global optimization problem is considered where the objective functions are assumed “black box” and “expensive”. An algorithm is theoretically substantiated using a statistical model of objective functions and the theory of rational decision making under uncertainty. The search process is defined as a sequence of bi-objective selections of sites for the computation of the objective function values. It is shown that two well known (the maximum average improvement, and the maximum improvement probability) algorithms are special cases of the proposed general approach.
Original language | English (US) |
---|---|
Pages (from-to) | 599-609 |
Number of pages | 11 |
Journal | Journal of Global Optimization |
Volume | 74 |
Issue number | 4 |
DOIs | |
State | Published - Aug 15 2019 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Control and Optimization
- Applied Mathematics
- Business, Management and Accounting (miscellaneous)
- Computer Science Applications
- Management Science and Operations Research
Keywords
- Bi-objective decision making
- Global optimization
- Kriging
- Rational decision making under uncertainty
- Statistical models