Using approximations to accelerate engineering design optimization

Optimization problems that arise in engineering design are often characterized by several features that hinder the use of standard nonlinear optimization techniques. Foremost among these features is that the functions used to define the engineering optimization problem often are computationally intensive. Within a standard nonlinear optimization algorithm, the computational expense of evaluating the functions that define the problem would necessarily be incurred for each iteration of the optimization algorithm. Faced with such prohibitive computational costs, an attractive alternative is to make use of surrogates within an optimization context since surrogates can be chosen or constructed so that they are typically much less expensive to compute. For the purposes of this paper, we will focus on the use of algebraic approximations as surrogates for the objective. In this paper we introduce the use of so-called merit functions that explicitly recognize the desirability of improving the current approximation to the objective during the course of the optimization. We define and experiment with the use of merit functions chosen to simultaneously improve both the solution to the optimization problem (the objective) and the quality of the approximation. Our goal is to further improve the effectiveness of our general approach without sacrificing any of its rigor.

[1]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[2]  A. Neumaier,et al.  A grid algorithm for bound constrained optimization of noisy functions , 1995 .

[3]  A. Owen Lattice Sampling Revisited: Monte Carlo Variance of Means Over Randomized Orthogonal Arrays , 1994 .

[4]  T. Coleman,et al.  Siag/opt Views-and-news a Forum for the Siam Activity Group on Optimization Chairman's Column Case Studies Ppcx: Solving Linear Programs in Parallel , 2007 .

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

[6]  J. Dennis,et al.  Direct Search Methods on Parallel Machines , 1991 .

[7]  Robert Michael Lewis,et al.  Pattern Search Methods for Linearly Constrained Minimization , 1999, SIAM J. Optim..

[8]  G. Box,et al.  On the Experimental Attainment of Optimum Conditions , 1951 .

[9]  G. S. Watson Smoothing and interpolation by kriging and with splines , 1984 .

[10]  V. Torczon,et al.  From Evolutionary Operation to Parallel Direct Search : Pattern Search Algorithms for Numerical Optimization , 1998 .

[11]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[12]  A. Goldstein,et al.  Optimization of functions whose values are subject to small errors , 1977 .

[13]  Anthony J. Kearsley,et al.  The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newton's Method , 1995 .

[14]  Virginia Torczon,et al.  Numerical Optimization Using Computer Experiments , 1997 .

[15]  M. D. McKay,et al.  A comparison of three methods for selecting values of input variables in the analysis of output from a computer code , 2000 .

[16]  R. H. Myers,et al.  Response Surface Methodology: Process and Product Optimization Using Designed Experiments , 1995 .

[17]  J. -F. M. Barthelemy,et al.  Approximation concepts for optimum structural design — a review , 1993 .

[18]  V. Torczon,et al.  RANK ORDERING AND POSITIVE BASES IN PATTERN SEARCH ALGORITHMS , 1996 .

[19]  A. J. Booker,et al.  A rigorous framework for optimization of expensive functions by surrogates , 1998 .

[20]  Robert Michael Lewis,et al.  Pattern Search Algorithms for Bound Constrained Minimization , 1999, SIAM J. Optim..

[21]  M. Powell A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation , 1994 .

[22]  Robert Hooke,et al.  `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[23]  J. Mockus Bayesian Approach to Global Optimization: Theory and Applications , 1989 .

[24]  Raphael T. Haftka,et al.  Sensitivity-based scaling for approximating. Structural response , 1993 .

[25]  D. Dennis,et al.  SDO : A Statistical Method for Global Optimization , 1997 .

[26]  D. Dennis,et al.  A statistical method for global optimization , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.

[27]  O. SIAMJ.,et al.  ON THE CONVERGENCE OF PATTERN SEARCH ALGORITHMS , 1997 .

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

[29]  P. Toint,et al.  An Algorithm using Quadratic Interpolation for Unconstrained Derivative Free Optimization , 1996 .

[30]  Douglas C. Montgomery,et al.  Response Surface Methodology: Process and Product Optimization Using Designed Experiments , 1995 .

[31]  Charles Van Loan,et al.  Introduction to Scientific Computing: A Matrix-Vector Approach Using MATLAB , 1996 .

[32]  J. Sacks,et al.  A system for quality improvement via computer experiments , 1991 .