Economics at your fingertips  

Exploring or reducing noise? A global optimization algorithm in the presence of noise

Didier Rulliere (), Alaeddine Faleh (), Frédéric Planchet () and Wassim Youssef
Additional contact information
Alaeddine Faleh: SAF - Laboratoire de Sciences Actuarielle et Financière - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon
Wassim Youssef: Winter & associés - Winter & associés

Post-Print from HAL

Abstract: We consider the problem of the global minimization of a function observed with noise. This problem occurs for example when the objective function is estimated through stochastic simulations. We propose an original method for iteratively partitioning the search domain when this area is a nite union of simplexes. On each subdomain of the partition, we compute an indicator measuring if the subdomain is likely or not to contain a global minimizer. Next areas to be explored are chosen in accordance with this indicator. Con dence sets for minimizers are given. Numerical applications show empirical convergence results, and illustrate the compromise to be made between the global exploration of the search domain and the focalization around potential minimizers of the problem.

Keywords: Golbal Optimisation; Simplex; Branch-and-Bound; Kriging (search for similar items in EconPapers)
Date: 2013
New Economics Papers: this item is included in nep-cmp, nep-ecm and nep-ore
Note: View the original document on HAL open archive server:
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed

Published in Structural and Multidisciplinary Optimization, 2013, 47 (6), pp.921-936. ⟨10.1007/s00158-012-0874-5⟩

Downloads: (external link) (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

DOI: 10.1007/s00158-012-0874-5

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().

Page updated 2023-06-15
Handle: RePEc:hal:journl:hal-00759677