Back to results

Virginia Tech

Adapting Response Surface Methods for the Optimization of Black-Box Systems

Abstract

dc:description.abstract

Complex mathematical models are often built to describe a physical process that would otherwise be extremely difficult, too costly or sometimes impossible to analyze. Generally, these models require solutions to many partial differential equations. As a result, the computer codes may take a considerable amount of time to complete a single evaluation. A time tested method of analysis for such models is Monte Carlo simulation. These simulations, however, often require many model evaluations, making this approach too computationally expensive. To limit the number of experimental runs, it is common practice to model the departure as a Gaussian stochastic process (GaSP) to develop an emulator of the computer model. One advantage for using an emulator is that once a GaSP is fit to realized outcomes, the computer model is easy to predict in unsampled regions of the input space. This is an attempt to 'characterize' the overall model of the computer code. Most of the historical work on design and analysis of computer experiments focus on the characterization of the computer model over a large region of interest. However, many practitioners seek other objectives, such as input screening (Welch et al., 1992), mapping a response surface, or optimization (Jones et al., 1998). Only recently have researchers begun to consider these topics in the design and analysis of computer experiments. In this dissertation, we explore a more traditional response surface approach (Myers, Montgomery and Anderson-Cook, 2009) in conjunction with traditional computer experiment methods to search for the optimum response of a process. For global optimization, Jones, Schonlau, and Welch's (1998) Efficient Global Optimization (EGO) algorithm remains a benchmark for subsequent research of computer experiments. We compare the proposed method in this paper to this leading benchmark. Our goal is to show that response surface methods can be effective means towards estimating an optimum response in the computer experiment framework.

Degree

thesis:*
Name thesis:degree_name
Ph. D.
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Statistics
Department dc:contributor.department
Statistics
Grantor dc:publisher
Virginia Tech
Year dc:date.issued
2010

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Zielinski, Jacob Jonathan
Chair dc:contributor.committeechair
  • Vining, G. Geoffrey
Committee members dc:contributor.committeemember
  • Patterson, Angela N.
  • House, Leanna L.
  • Birch, Jeffrey B.

Subjects

dc:subject × 7

Rights

dc:rights
Statement dc:rights
  • In Copyright

Identifiers

dc:identifier.*
Dc Identifier Other
etd-08302010-070400
OAI identifier oai:identifier
oai:vtechworks.lib.vt.edu:10919/39295

Chain of custody

source
Harvested from
Virginia Tech
Base URL
vtechworks.lib.vt.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Zielinski, Jacob Jonathan. Adapting Response Surface Methods for the Optimization of Black-Box Systems. doctoral thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/39295