Optimization Online


Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization

Giampaolo Liuzzi(giampaolo.liuzzi***at***iasi.cnr.it)
Stefano Lucidi(lucidi***at***dis.uniroma1.it)
Veronica Piccialli(piccialli***at***disp.uniroma2.it)

Abstract: In this paper we consider bound constrained global optimization problems where first-order derivatives of the objective function can be neither computed nor approximated explicitly. For the solution of such problems the DIRECT Algorithm has been proposed which has strong convergence properties and a good ability to locate promising regions of the feasible domain. However, the efficiency of DIRECT deteriorates as the dimension and the ill-conditioning of the objective function increase. To overcome these limits, we propose DIRECT-type algorithms enriched by the efficient use of derivative-free local searches combined with nonlinear transformations of the feasible domain and, possibly, of the objective function. We report extensive numerical results both on test problems from the literature and on an application in structural proteomics.

Keywords: Global optimization; DIRECT-type algorithms; Local minimizations

Category 1: Global Optimization

Category 2: Applications -- Science and Engineering (Biomedical Applications )

Citation: R. 1, 2014, IASI-CNR

Download: [Postscript][PDF]

Entry Submitted: 02/28/2014
Entry Accepted: 02/28/2014
Entry Last Modified: 02/28/2014

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 Optimization Society