Please use this identifier to cite or link to this item:

TitleOptimizing 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.
KeywordsGlobal optimization
Derivative-free optimization
Direct-search methods
Search step
Radial basis functions
D. C. programming
Issue date2012
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 versionA publicação original está disponível em
AccessRestricted access (UMinho)
Appears in Collections:LES/ALG - Artigos em revistas científicas internacionais com arbitragem

Files in This Item:
File Description SizeFormat 
  Restricted access
Draft1,03 MBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID