The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
SNOBFIT -- Stable Noisy Optimization by Branch and Fit
Abstract
The software package SNOBFIT for bound-constrained (and soft-constrained) noisy optimization of an expensive objective function is described. It combines global and local search by branching and local fits. The program is made robust and flexible for practical use by allowing for hidden constraints, batch function evaluations, change of search regions, etc.
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
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 · cited 1×
“Schonlau [Schonlau 1997; 2001; Schonlau et al. 1998] (see also [ Jones et al. 1998 ] for the similar algorithm EGO) uses the DACE approach resp.”
MethodMcKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
Design and Analysis of Computer Experiments
Sacks, J., Welch, W. J., Mitchell, T. J., & Wynn, H. P. (1989) · Statistical Science · doi:10.1214/ss/1177012413 · Cited by 6,919
A Taxonomy of Global Optimization Methods Based on Response Surfaces
Jones, D. R. (2001) · Journal of Global Optimization · doi:10.1023/a:1012771025575 · Cited by 2,159
Lipschitzian optimization without the Lipschitz constant
Jones, D. R., Perttunen, C. D., & Stuckman, B. E. (1993) · Journal of Optimization Theory and Applications · doi:10.1007/bf00941892 · Cited by 1,976
More Test Examples for Nonlinear Programming Codes
Schittkowski, K. (1987) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-61582-5 · Cited by 1,203
A rigorous framework for optimization of expensive functions by surrogates
Booker, A. J., Dennis, J. E., Frank, P. D., Serafini, D. B., Torczon, V., & Trosset, M. W. (1999) · Structural Optimization · doi:10.1007/bf01197708 · Cited by 960
Orthogonal Array-Based Latin Hypercubes
Tang, B. (1993) · Journal of the American Statistical Association · doi:10.1080/01621459.1993.10476423 · Cited by 858
Screening, Predicting, and Computer Experiments
Welch, W. J., Buck, R. J., Sacks, J., Wynn, H. P., Mitchell, T. J., & Morris, M. D. (1992) · Technometrics · doi:10.2307/1269548 · Cited by 630
Direct search algorithms for optimization calculations
Powell, M. J. D. (1998) · Acta Numerica · doi:10.1017/s0962492900002841 · Cited by 558
Global Optimization by Multilevel Coordinate Search
Huyer, W., & Neumaier, A. (1999) · Journal of Global Optimization · doi:10.1023/a:1008382309369 · Cited by 505
Self-citationGlobal versus local search in constrained optimization of computer models
Schonlau, M., Welch, W. J., & Jones, D. R. (1998) · Institute of Mathematical Statistics Lecture Notes - Monograph Series · doi:10.1214/lnms/1215456182 · Cited by 435
Computer experiments and global optimization
Welch, W. J., & Schonlau, M. (1997) · Library and Archives Canada (Government of Canada) · Cited by 382
UOBYQA: unconstrained optimization by quadratic approximation
Powell, M. J. D. (2002) · Mathematical Programming · doi:10.1007/s101070100290 · Cited by 352
Recent progress in unconstrained nonlinear optimization without derivatives
Conn, A. R., Scheinberg, K., & Toint, P. L. (1997) · Mathematical Programming · doi:10.1007/bf02614326 · Cited by 255
Berghen, F. V., & Bersini, H. (2005) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2004.11.029 · Cited by 135
Global optimization by continuous grasp
Hirsch, M. J., Meneses, C. N., Pardalos, P. M., & Resende, M. G. C. (2006) · Optimization Letters · doi:10.1007/s11590-006-0021-6 · Cited by 108
A grid algorithm for bound constrained optimization of noisy functions
Elster, C., & Neumaier, A. (1995) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/15.4.585 · Cited by 60
Self-citationA Direct Search Algorithm for Optimization with Noisy Function Evaluations
Anderson, E. J., & Ferris, M. C. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623496312848 · Cited by 54
Health Monitoring Sensor Placement Optimization Under Uncertainty
Guratzsch, R. F., & Mahadevan, S. (2006) · AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference (MAO) · doi:10.2514/6.2006-7034 · Cited by 15
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Derivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M., & Sahinidis, N. V. (2013) · Journal of Global Optimization · doi:10.1007/s10898-012-9951-y · Cited by 1,276
Buglioni, L., Raymenants, F., Slattery, A., Zondag, S. D. A., & Noël, T. (2022) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00332 · Cited by 781
Self-Driving Laboratories for Chemistry and Materials Science
Tom, G., Schmid, S. P., Baird, S. G., Cao, Y., Darvish, K., Hao, H., Lo, S., Pablo-García, S., Rajaonson, E. M., Skreta, M., et al. (2024) · Chemical Reviews · doi:10.1021/acs.chemrev.4c00055 · Cited by 707
Nanoparticle synthesis assisted by machine learning
Tao, H., Wu, T., Aldeghi, M., Wu, T. C., Aspuru-Guzik, A., & Kumacheva, E. (2021) · Nature Reviews Materials · doi:10.1038/s41578-021-00337-5 · Cited by 545
Metadata
- Authors
- Huyer, W., & Neumaier, A.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2008-07
- Volume
- 35
- Issue
- 2
- Pages
- 1-25
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2092070658
- Cited by
- 262
- References
- 22
- FWCI
- 9.18
- 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
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.