Response surface methods show promising results for global optimization of costly non convex objective functions, i.e. the problem of finding the global minimum when there are several local minima and each function value takes considerable CPU time to compute. Such problems often arise in industrial and financial applications, where a function value could be a result of a time-consuming computer simulation or optimization. Derivatives are most often hard to obtain. The problem is here extended with linear and nonlinear constraints, and the nonlinear constraints can be costly or not. A new algorithm that handles the constraints, based on radial basis functions (RBF), and that preserves the convergence proof of the original RBF algorithm is presented. The algorithm takes advantage of the optimization algorithms in the Tomlab optimization environment (www.tomlab.biz). Numerical results are presented for standard test problems.
[1]
Kenneth Holmstrom,et al.
The TOMLAB Optimization Environment in Matlab
,
1999
.
[2]
Kenneth Holmström,et al.
The TOMLAB Optimization Environment
,
2004
.
[3]
Kenneth Holmström,et al.
Global Optimization Using the DIRECT Algorithm in Matlab
,
1999
.
[4]
M. Powell.
Recent research at Cambridge on radial basis functions
,
1999
.
[5]
Mattias Björkman,et al.
Global Optimization of Costly Nonconvex Functions Using Radial Basis Functions
,
2000
.
[6]
Hans-Martin Gutmann,et al.
A Radial Basis Function Method for Global Optimization
,
2001,
J. Glob. Optim..
[7]
Michael James Sasena,et al.
Flexibility and efficiency enhancements for constrained global design optimization with kriging approximations.
,
2002
.