Black-box Objective Function Research Articles

Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions

This paper presents a new algorithm for derivative-free optimization of expensive black-box objective functions subject to expensive black-box inequality constraints. The proposed algorithm, called ConstrLMSRBF, uses radial basis function (RBF) surrogate models and is an extension of the Local Metric Stochastic RBF (LMSRBF) algorithm by Regis and Shoemaker (2007a) [1] that can handle black-box inequality constraints. Previous algorithms for the optimization of expensive functions using surrogate models have mostly dealt with bound constrained problems where only the objective function is expensive, and so, the surrogate models are used to approximate the objective function only. In contrast, ConstrLMSRBF builds RBF surrogate models for the objective function and also for all the constraint functions in each iteration, and uses these RBF models to guide the selection of the next point where the objective and constraint functions will be evaluated. Computational results indicate that ConstrLMSRBF is better than alternative methods on 9 out of 14 test problems and on the MOPTA08 problem from the automotive industry (Jones, 2008 [2]). The MOPTA08 problem has 124 decision variables and 68 inequality constraints and is considered a large-scale problem in the area of expensive black-box optimization. The alternative methods include a Mesh Adaptive Direct Search (MADS) algorithm (Abramson and Audet, 2006 [3]; Audet and Dennis, 2006 [4]) that uses a kriging-based surrogate model, the Multistart LMSRBF algorithm by Regis and Shoemaker (2007a) [1] modified to handle black-box constraints via a penalty approach, a genetic algorithm, a pattern search algorithm, a sequential quadratic programming algorithm, and COBYLA (Powell, 1994 [5]), which is a derivative-free trust-region algorithm. Based on the results of this study, the results in Jones (2008) [2] and other approaches presented at the ISMP 2009 conference, ConstrLMSRBF appears to be among the best, if not the best, known algorithm for the MOPTA08 problem in the sense of providing the most improvement from an initial feasible solution within a very limited number of objective and constraint function evaluations.

Multicriteria optimization with a multiobjective golden section line search

This work presents an algorithm for multiobjective optimization that is structured as: (i) a descent direction is calculated, within the cone of descent and feasible directions, and (ii) a multiobjective line search is conducted over such direction, with a new multiobjective golden section segment partitioning scheme that directly finds line-constrained efficient points that dominate the current one. This multiobjective line search procedure exploits the structure of the line-constrained efficient set, presenting a faster compression rate of the search segment than single-objective golden section line search. The proposed multiobjective optimization algorithm converges to points that satisfy the Kuhn-Tucker first-order necessary conditions for efficiency (the Pareto-critical points). Numerical results on two antenna design problems support the conclusion that the proposed method can solve robustly difficult nonlinear multiobjective problems defined in terms of computationally expensive black-box objective functions.

Optimization With High-Cost Objective Function Evaluations in a Computing Grid and an Application To Simulation-Based Design

The emerging grid computing technologies are aimed at the creation of virtual supercomputers to conduct huge scale scientific computations by harvesting computing resources on the Internet. This paper introduces a grid-enabled implementation of an optimization program for large-scale optimization problems requiring high-cost, black-box objective function evaluations. Adopting grid computing can be particularly beneficial for building surrogates such as response surfaces and carrying out large-scale optimizations using stochastic optimization algorithms. However, several problems have to be resolved for effective utilization of grid resources because of heterogeneity in computer capacity among grid resources and limited network conditions inherent in grid systems. This paper identifies some of the problems and introduces algorithms to effectively carry out large-scale optimizations on a grid. Specifically, asynchronous genetic and particle swarm optimization algorithms are developed for grid computing environments. The performance and characteristics of the grid-enabled implementations are assessed via extensive numerical tests. Finally, structural design based on high-fidelity simulations is carried out using the proposed algorithm in a computing grid system.

Multi-objective optimization based on meta-modeling by using support vector regression

Practical engineering design problems have a black-box objective function whose forms are not explicitly known in terms of design variables. In those problems, it is very important to make the number of function evaluations as few as possible in finding an optimal solution. So, in this paper, we propose a multi-objective optimization method based on meta-modeling predicting a form of each objective function by using support vector regression. In addition, we discuss a way how to select additional experimental data for sequentially revising a form of objective function. Finally, we illustrate the effectiveness of the proposed method through some numerical examples.