The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Lipschitzian optimization without the Lipschitz constant
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
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
Computational geometry. an introduction
Preparata, F. P., & Shamos, M. I. (1985) · Cited by 2,488
A Sequential Method Seeking the Global Maximum of a Function
Shubert, B. O. (1972) · SIAM Journal on Numerical Analysis · doi:10.1137/0709036 · Cited by 407
A stochastic method for global optimization
Boender, C. G. E., Rinnooy Kan, A. H. G., Timmer, G. T., & Stougie, L. (1982) · Mathematical Programming · doi:10.1007/bf01581033 · Cited by 257
A multi-start global minimization algorithm with dynamic search trajectories
Snyman, J. A., & Fatti, L. P. (1987) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940408 · Cited by 145
Cited by
Taking the Human Out of the Loop: A Review of Bayesian Optimization
Shahriari, B., Swersky, K., Wang, Z., Adams, R. P., & de Freitas, N. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2494218 · Cited by 6,049
Brochu, E., Cora, V. M., & de Freitas, N. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.2599 · Cited by 2,011
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Kolda, T. G., Lewis, R. M., & Torczon, V. (2003) · SIAM Review · doi:10.1137/s003614450242889 · Cited by 1,653
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
Huang, L., Joseph, A. D., Nelson, B., Rubinstein, B. I. P., & Tygar, J. D. (2011) · Proceedings of the 4th ACM workshop on Security and artificial intelligence · doi:10.1145/2046684.2046692 · Cited by 1,194
Metadata
- Authors
- Jones, D. R., Perttunen, C. D., & Stuckman, B. E.
- Venue
- Journal of Optimization Theory and Applications
- Published
- 1993-10
- Volume
- 79
- Issue
- 1
- Pages
- 157-181
- ISSN
- 0022-3239 (ISSN-L)
- 1573-2878
- OpenAlex
- W2113741278
- Cited by
- 1,976
- References
- 5
- FWCI
- 1.21
- 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.