A surrogate-model-based method for constrained optimization

This paper describes an algorithm and provides test results for surrogate-model-based optimization. In this type of optimization, the objective and constraint functions are represented by global "surrogates", i.e. response models, of the "true" problem responses. In general, guarantees of global optimality are not possible. However, a robust surrogate-model-based optimization method is presented here that has good global search properties, and proven local convergence results. This paper describes methods for handling three key issues in surrogate-model-based optimization. These issues are maintaining a balance of effort between global design space exploration and local optimizer region refinement, maintaining good surrogate model conditioning as points "pile up" in local regions, and providing a provably convergent method for ensuring local optimality. Acknowledgments: Work of the first author was supported by NSERC (Natural Sciences and Engineering Research Council) fellowship PDF-2074321998, and the first three authors was supported by DOE DE-FG03-95ER25257, AFOSR F49620-98-10267, The Boeing Company, Sandia LG-4253, ExxonMobil and CRPC CCR-9120008. Copyright ©2000 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved.

[1]  Robert Michael Lewis,et al.  A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds , 2002, SIAM J. Optim..

[2]  C. D. Boor,et al.  Computational aspects of polynomial interpolation in several variables , 1992 .

[3]  Bernard Grossman,et al.  A Coarse-Grained Parallel Variable-Complexity Multidisciplinary Optimization Paradigm , 1996, Int. J. High Perform. Comput. Appl..

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

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

[6]  Nicholas I. M. Gould,et al.  Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming , 2002, SIAM J. Optim..

[7]  T. J. Mitchell,et al.  Bayesian Prediction of Deterministic Functions, with Applications to the Design and Analysis of Computer Experiments , 1991 .

[8]  William J. Welch,et al.  Computer experiments and global optimization , 1997 .

[9]  Anthony A. Giunta,et al.  Aircraft Multidisciplinary Design Optimization using Design of Experiments Theory and Response Surface Modeling Methods , 1997 .

[10]  C. Currin,et al.  A Bayesian Approach to the Design and Analysis of Computer Experiments , 1988 .

[11]  Virginia Torczon,et al.  On the Convergence of Pattern Search Algorithms , 1997, SIAM J. Optim..

[12]  Sven Leyffer,et al.  Nonlinear programming without a penalty function , 2002, Math. Program..

[13]  Jerome Sacks,et al.  Designs for Computer Experiments , 1989 .

[14]  John E. Dennis,et al.  Managing surrogate objectives to optimize a helicopter rotor design - Further experiments , 1998 .

[15]  Andrew Booker,et al.  Design and analysis of computer experiments , 1998 .

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