A Kriging-based constrained global optimization algorithm for expensive black-box functions with infeasible initial points

In many engineering optimization problems, the objective and the constraints which come from complex analytical models are often black-box functions with extensive computational effort. In this case, it is necessary for optimization process to use sampling data to fit surrogate models so as to reduce the number of objective and constraint evaluations as soon as possible. In addition, it is sometimes difficult for the constrained optimization problems based on surrogate models to find a feasible point, which is the premise of further searching for a global optimal feasible solution. For this purpose, a new Kriging-based Constrained Global Optimization (KCGO) algorithm is proposed. Unlike previous Kriging-based methods, this algorithm can dispose black-box constrained optimization problem even if all initial sampling points are infeasible. There are two pivotal phases in KCGO algorithm. The main task of the first phase is to find a feasible point when there is no feasible data in the initial sample. And the aim of the second phase is to obtain a better feasible point under the circumstances of fewer expensive function evaluations. Several numerical problems and three design problems are tested to illustrate the feasibility, stability and effectiveness of the proposed method.

[1]  Thomas J. Santner,et al.  The Design and Analysis of Computer Experiments , 2003, Springer Series in Statistics.

[2]  Jay D. Martin,et al.  Computational Improvements to Estimating Kriging Metamodel Parameters , 2009 .

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

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

[5]  D. Krige.  A statistical approach to some basic mine valuation problems on the Witwatersrand, by D.G. Krige, published in the Journal, December 1951 : introduction by the author , 1951 .

[6]  Kalyanmoy Deb,et al.  Constrained Efficient Global Optimization for Pultrusion Process , 2015 .

[7]  Mattias Björkman,et al.  Global Optimization of Costly Nonconvex Functions Using Radial Basis Functions , 2000 .

[8]  Rommel G. Regis,et al.  Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions , 2011, Comput. Oper. Res..

[9]  R. Regis.  Constrained optimization by radial basis function interpolation for high-dimensional expensive black-box problems with infeasible initial points , 2014 .

[10]  M. Sasena,et al.  Exploration of Metamodeling Sampling Criteria for Constrained Global Optimization , 2002 .

[11]  Efrén Mezura-Montes,et al.  Empirical analysis of a modified Artificial Bee Colony for constrained numerical optimization , 2012, Appl. Math. Comput..

[12]  M. Eldred,et al.  Efficient Global Reliability Analysis for Nonlinear Implicit Performance Functions , 2008 .

[13]  H. Takagi,et al.  Mixed-fidelity Efficient Global Optimization Applied to Design of Supersonic Wing , 2013 .

[14]  J. Friedman.  Multivariate adaptive regression splines , 1990 .

[15]  Vladimir Balabanov,et al.  Combined Kriging and Gradient-Based Optimization Method , 2006 .

[16]  Christine A. Shoemaker,et al.  Constrained Global Optimization of Expensive Black Box Functions Using Radial Basis Functions , 2005, J. Glob. Optim..

[17]  G. G. Wang,et al.  Mode-pursuing sampling method for global optimization on expensive black-box functions , 2004 .

[18]  Samy Missoum,et al.  A Sampling-Based Approach for Probabilistic Design with Random Fields , 2008 .

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

[20]  Donald R. Jones,et al.  A Taxonomy of Global Optimization Methods Based on Response Surfaces , 2001, J. Glob. Optim..

[21]  N. Zheng,et al.  Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models , 2006, J. Glob. Optim..

[22]  Zhengdong Huang,et al.  An Incremental Kriging Method for Sequential OptimalExperimental Design , 2014 .

[23]  Shapour Azarm,et al.  Multi-level design optimization using global monotonicity analysis , 1989 .

[24]  Victor Picheny,et al.  A Stepwise uncertainty reduction approach to constrained global optimization , 2014, AISTATS.

[25]  Silvana M. B. Afonso,et al.  A concurrent efficient global optimization algorithm applied to polymer injection strategies , 2010 .

[26]  Søren Nymand Lophaven,et al.  DACE - A Matlab Kriging Toolbox , 2002 .

[27]  A. Basudhar,et al.  Constrained efficient global optimization with support vector machines , 2012, Structural and Multidisciplinary Optimization.

[28]  Jasbir S. Arora,et al.  Introduction to Optimum Design , 1988 .

[29]  Charles Audet,et al.  A surrogate-model-based method for constrained optimization , 2000 .

[30]  R. L. Hardy.  Multiquadric equations of topography and other irregular surfaces , 1971 .

[31]  Fred van Keulen,et al.  Efficient Kriging-based robust optimization of unconstrained problems , 2014, J. Comput. Sci..

[32]  Fabio Schoen,et al.  Global optimization of expensive black box problems with a known lower bound , 2013, J. Glob. Optim..

[33]  S. Gunn.  Support Vector Machines for Classification and Regression , 1998 .