LOOM, an algorithm for finding local optima of expensive functions - Université Clermont Auvergne Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

LOOM, an algorithm for finding local optima of expensive functions

Résumé

Engineering optimization often involves one or many computationally intensive softwares that must be called to calculate the performance of candidate solutions. Despite the calculation cost, it is useful to characterize the global and the local optima. A new algorithm is described here that searches for all the local optima in a reduced number of calls to the true performance functions. The algorithm is based on repeated local searches on metamodels of the true performance functions and called LOOM (LOcal Optima through Metamodels). The local optima are identified as an output of the search. The search distributes computational resources equally among the basins of attraction. This article presents the algorithm and describes a first series of tests in two dimensions where a kriging metamodel is used.
Fichier non déposé

Dates et versions

emse-00867493 , version 1 (30-09-2013)

Identifiants

  • HAL Id : emse-00867493 , version 1

Citer

Jeremy Riviere, Rodolphe Le Riche, Gauthier Picard. LOOM, an algorithm for finding local optima of expensive functions. NICST'2013, New and smart Information Communication Science and Technology to support Sustainable Development, Sep 2013, Clermont Ferrand, France. 7 p. ⟨emse-00867493⟩
242 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More