Please use this identifier to cite or link to this item:
|Title:||Optimizing radial basis functions by D.C. programming and its use in direct search for global derivative-free optimization|
|Author(s):||Le Thi, H. A.|
Vaz, A. Ismael F.
Vicente, L. N.
Radial basis functions
D. C. programming
|Abstract(s):||In this paper we address the global optimization of functions subject to bound and linear constraints without using derivatives of the objective function. We investigate the use of derivative-free models based on radial basis functions (RBFs) in the search step of direct-search methods of directional type. We also study the application of algorithms based on difference of convex (d.c.) functions programming to solve the resulting subproblems which consist of the minimization of the RBF models subject to simple bounds on the variables. Extensive numerical results are reported with a test set of bound and linearly constrained problems.|
|Publisher version:||A publicação original está disponível em www.springerlink.com|
|Access:||Restricted access (UMinho)|
|Appears in Collections:||LES/ALG - Artigos em revistas científicas internacionais com arbitragem|
Files in This Item:
|Draft||1,03 MB||Adobe PDF||View/Open|