Sequential Experiment Design for Contour Estimation From Complex Computer Codes

Computer simulation often is used to study complex physical and engineering processes. Although a computer simulator often can be viewed as an inexpensive way to gain insight into a system, it still can be computationally costly. Much of the recent work on the design and analysis of computer experiments has focused on scenarios where the goal is to fit a response surface or process optimization. In this article we develop a sequential methodology for estimating a contour from a complex computer code. The approach uses a stochastic process model as a surrogate for the computer simulator. The surrogate model and associated uncertainty are key components in a new criterion used to identify the computer trials aimed specifically at improving the contour estimate. The proposed approach is applied to exploration of a contour for a network queuing system. Issues related to practical implementation of the proposed approach also are addressed.

[1]  Russ Wolfinger,et al.  Computing Gaussian Likelihoods and Their Derivatives for General Linear Mixed Models , 1994, SIAM J. Sci. Comput..

[2]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[3]  Karel Uhlir.  Modeling methods with implicitly defined objects , 2003 .

[4]  R. Wolfinger,et al.  Spatial Regression Models, Response Surfaces, and Process Optimization , 1997 .

[5]  Jean Walrand.  An introduction to queuing networks , 1988 .

[6]  Abhyuday Mandal,et al.  SELC: Sequential Elimination of Level Combinations by Means of Modified Genetic Algorithms , 2006, Technometrics.

[7]  Katta G. Murty,et al.  Operations Research: Deterministic Optimization Models , 1994 .

[8]  R. Sokal,et al.  Detecting Regions of Abrupt Change in Maps of Biological Variables , 1989 .

[9]  C. R. Rao,et al.  Estimation of Variance and Covariance Components in Linear Models , 1972 .

[10]  Vaclav Skala,et al.  The Implicit Function Modelling System-Comparison of C++ and C# Solutions , 2003 .

[11]  Remco C. Veltkamp,et al.  Shape matching: similarity measures and algorithms , 2001, Proceedings International Conference on Shape Modeling and Applications.

[12]  Bradley P. Carlin,et al.  Bayesian areal wombling for geographical boundary analysis , 2005 .

[13]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[14]  P. Siarry,et al.  An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization , 2000 .

[15]  G. Michailidis,et al.  Queueing and scheduling in random environments , 2004, Advances in Applied Probability.

[16]  Richard J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.

[17]  Donald R. Jones,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..

[18]  Sudipto Banerjee,et al.  Bayesian Wombling , 2006, Journal of the American Statistical Association.

[19]  Rebecca Campbell,et al.  A Comparison of Three Methods , 2003 .

[20]  Zhiying Jin,et al.  Optimal sequential designs for on-line item estimation , 1994 .

[21]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[22]  R. J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output... , 2000 .

[23]  W. Rudin.  Real and complex analysis , 1968 .

[24]  D. G. Fisher,et al.  Introduction to Queuing Networks , 1989 .

[25]  Sonja Kuhnt,et al.  Design and analysis of computer experiments , 2010 .

[26]  M. E. Johnson,et al.  Minimax and maximin distance designs , 1990 .

[27]  Donald Ylvisaker,et al.  Minimax distance designs in two-level factorial experiments , 1995 .

[28]  Hugues Mounier,et al.  Automated transformation-invariant shape recognition through wavelet multiresolution , 2001, SPIE Optics + Photonics.

[29]  W. Rudin.  Real and complex analysis, 3rd ed. , 1987 .

[30]  K. Schittkowski.  NLPQL: A fortran subroutine solving constrained nonlinear programming problems , 1986 .

[31]  Andy J. Keane,et al.  On the Design of Optimization Strategies Based on Global Response Surface Approximation Models , 2005, J. Glob. Optim..

[32]  A. V. Levy,et al.  The Tunneling Algorithm for the Global Minimization of Functions , 1985 .

[33]  Boxin Tang.  Orthogonal Array-Based Latin Hypercubes , 1993 .

[34]  C. R. Henderson,et al.  Best linear unbiased estimation and prediction under a selection model. , 1975, Biometrics.

[35]  Donald R. Jones,et al.  Global versus local search in constrained optimization of computer models , 1998 .

[36]  Yong Zhang,et al.  Uniform Design: Theory and Application , 2000, Technometrics.

[37]  Stephen P. Boyd,et al.  Branch and bound algorithm for computing the minimum stability degree of parameter-dependent linear systems , 1991, International Journal of Robust and Nonlinear Control.