The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions
Abstract
We introduce a new framework for the global optimization of computationally expensive multimodal functions when derivatives are unavailable. The proposed Stochastic Response Surface (SRS) Method iteratively utilizes a response surface model to approximate the expensive function and identifies a promising point for function evaluation from a set of randomly generated points, called candidate points. Assuming some mild technical conditions, SRS converges to the global minimum in a probabilistic sense. We also propose Metric SRS (MSRS), which is a special case of SRS where the function evaluation point in each iteration is chosen to be the best candidate point according to two criteria: the estimated function value obtained from the response surface model, and the minimum distance from previously evaluated points. We develop a global optimization version and a multistart local optimization version of MSRS. In the numerical experiments, we used a radial basis function (RBF) model for MSRS and the resulting algorithms, Global MSRBF and Multistart Local MSRBF, were compared to 6 alternative global optimization methods, including a multistart derivative-based local optimization method. Multiple trials of all algorithms were compared on 17 multimodal test problems and on a 12-dimensional groundwater bioremediation application involving partial differential equations. The results indicate that Multistart Local MSRBF is the best on most of the higher dimensional problems, including the groundwater problem. It is also at least as good as the other algorithms on most of the lower dimensional problems. Global MSRBF is competitive with the other alternatives on most of the lower dimensional test problems and also on the groundwater problem. These results suggest that MSRBF is a promising approach for the global optimization of expensive functions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
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
Cressie, N. A. C. (1993) · Wiley Series in Probability and Statistics · doi:10.1002/9781119115151 · Cited by 6,507
Cited by
Sun, L., Gao, H., Pan, S., & Wang, J.-X. (2020) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2019.112732 · Cited by 1,045
Benchmarking Derivative-Free Optimization Algorithms
Moré, J. J., & Wild, S. M. (2009) · SIAM Journal on Optimization · doi:10.1137/080724083 · Cited by 573
Sun, Q., Ye, Z.-S., & Zhu, X. (2020) · IISE Transactions · doi:10.1080/24725854.2019.1672908 · Cited by 108
Gao, H., Zhu, X., & Wang, J.-X. (2020) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2020.113047 · Cited by 27
Dynamical learning of a photonics quantum-state engineering process
Suprano, A., Zia, D., Polino, E., Giordani, T., Innocenti, L., Ferraro, A., Paternostro, M., Spagnolo, N., & Sciarrino, F. (2021) · Advanced Photonics · doi:10.1117/1.ap.3.6.066002 · Cited by 20
Metadata
- Authors
- Regis, R. G., & Shoemaker, C. A.
- Venue
- INFORMS Journal on Computing
- Published
- 2007-11
- Volume
- 19
- Issue
- 4
- Pages
- 497-509
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W1988945200
- Cited by
- 528
- References
- 4
- FWCI
- 6.25
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions. https://app.cochat.ai/papers/10.1287/ijoc.1060.0182
- The paper
- Regis, R. G., & Shoemaker, C. A. (2007). A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.1060.0182
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.