Optimization Online


Constrained Global Optimization with Radial Basis Functions

Jan-Erik Käck (jan-erik.kack***at***mdh.se)

Abstract: 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.

Keywords: Costly Global Optimization, RBF, Constraints, Black-Box

Category 1: Global Optimization (Theory )

Category 2: Other Topics (Optimization of Simulated Systems )

Citation: Department of Mathematics and Physics Mälardalen University P.O. Box 883 SE-721 23 Västerås, Sweden Research Report MdH,IMa - 2004

Download: [PDF]

Entry Submitted: 09/14/2004
Entry Accepted: 09/14/2004
Entry Last Modified: 09/14/2004

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society