Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 435

The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.

Global versus local search in constrained optimization of computer models

Schonlau, Matthias, Welch, William J., Jones, Donald R.·1998·Institute of Mathematical Statistics Lecture Notes - Monograph Series

Abstract

Engineering systems are now frequently optimized via computer models.The inputoutput relationships in these models are often highly nonlinear deterministic functions that are expensive to compute.Thus, when searching for the global optimum, it is desirable to minimize the number of function evaluations.Bayesian global optimization methods are well-suited to this task because they make use of all previous evaluations in selecting the next search point.A statistical model is fit to the sampled points which allows predictions to be made elsewhere, along with a measure of possible prediction error (uncertainty).The next point is chosen to maximize a criterion that balances searching where the predicted value of the function is good (local search) with searching where the uncertainty of prediction is large (global search).We extend this methodology in several ways.First, we introduce a parameter that controls the local-global balance.Secondly, we propose a method for dealing with nonlinear inequality constraints from additional response variables.Lastly, we adapt the sequential algorithm to proceed in stages rather than one point at a time.The extensions are illustrated using a shape optimization problem from the automotive industry. Introduction.Global optimization via a computer model (sometimes called a computer code) is a problem encountered frequently in engineering.In this article, for example, we will discuss the optimization of the shape of an automobile piston.The inputs to the piston model are parameters describing the piston shape.The outputs are quality characteristics: undesirable piston motion (which causes noise) and the maximum pressure between the piston and the bore (which affects wear).The objective is to find the combination of shape parameters that minimizes maximum pressure subject to a constraint on motion.When function evaluations are fairly expensive, as here, there is a need to use optimization methods that require few evaluations.We shall see that the objective, maximum pressure, is highly nonlinear in the shape parameters; hence, some care is also necessary to find the global optimum.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1214/lnms/1215456182

Cites

14 of 14 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 14 references

Cited by

See all 435

Metadata

Authors
Schonlau, M., Welch, W. J., & Jones, D. R.
Venue
Institute of Mathematical Statistics Lecture Notes - Monograph Series
Published
1998
Pages
11-25
ISSN
0749-2170 (ISSN-L)
OpenAlex
W1588959569
Cited by
435
References
14
FWCI
4.86
Type
book chapter
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: Global versus local search in constrained optimization of computer models. https://app.cochat.ai/papers/10.1214/lnms/1215456182
The paper
Schonlau, M., Welch, W. J., & Jones, D. R. (1998). Global versus local search in constrained optimization of computer models. Institute of Mathematical Statistics Lecture Notes - Monograph Series. https://doi.org/10.1214/lnms/1215456182

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.