The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Surrogate‐based methods for black‐box optimization
Open accessAbstract
In this paper, we survey methods that are currently used in black‐box optimization, that is, the kind of problems whose objective functions are very expensive to evaluate and no analytical or derivative information is available. We concentrate on a particular family of methods, in which surrogate (or meta) models are iteratively constructed and used to search for global solutions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
Engineering Design via Surrogate Modelling: A Practical Guide
Forrester, A. I. J., Sóbester, A., & Keane, A. J. (2008) · doi:10.1002/9780470770801 · Cited by 2,309
Minimax and maximin distance designs
Johnson, M. E., Moore, L. M., & Ylvisaker, D. (1990) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(90)90122-b · Cited by 1,451
Cited by
AutoML: A survey of the state-of-the-art
He, X., Zhao, K., & Chu, X. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.106622 · Cited by 1,691
Derivative-free optimization methods
Larson, J., Menickelly, M., & Wild, S. M. (2019) · Acta Numerica · doi:10.1017/s0962492919000060 · Cited by 381
Design of computer experiments: A review
Garud, S. S., Karimi, I. A., & Kraft, M. (2017) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2017.05.010 · Cited by 348
Metadata
- Authors
- Vu, K. K., D'Ambrosio, C., Hamadi, Y., & Liberti, L.
- Venue
- International Transactions in Operational Research
- Publisher
- Wiley
- Published
- 2016-04-20
- Volume
- 24
- Issue
- 3
- Pages
- 393-424
- ISSN
- 0969-6016 (ISSN-L)
- 1475-3995
- OpenAlex
- W2338548332
- Cited by
- 180
- References
- 4
- FWCI
- 13.70
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.