Notes on the convergence and applications of surrogate optimization

Pages: 947 - 956, Issue Special, August 2005

 Abstract        Full Text (254.5K)              

Chunlei Zhang - Department of Electrical and Computer Engineering, University of Dayton, Dayton, OH45469-0226, United States (email)
Qin Sheng - Department of Mathematics, Baylor University, Waco, TX76798-7328, United States (email)
Raúl Ordóñez - Department of Electrical and Computer Engineering, University of Dayton, Dayton, OH 45469-0226, United States (email)

Abstract: Surrogate optimization is a computational procedure that uses a sequence of approximations of the objective function to predict an optimum. Even in the case when the derivative information of the objective function is not available, the surrogate functions can still be constructed only based on the function values. Moreover, the optimization method may provide required tools for computing the numerical solution of certain nonlinear differential equations in recent engineering applications, such as the optimal determination of the perturbation values in robot control dynamic systems [13, 16, 18]. In this paper, we will present a direct convergence analysis of the surrogate optimization process in one dimensional fashion via polynomial interpolations of objective function values. Numerical experiments will be given to illustrate the effectiveness of the algorithms developed. An application in multi-agent cooperative search problem will be also presented.

Keywords:  Surrogate optimization, approximation, interpolation, convergence.
Mathematics Subject Classification:  Primary: 65K10, 65K15; Secondary: 46N01.

Received: September 2004;      Revised: April 2005;      Published: September 2005.