Black-box optimization under constraints: simple selection algorithms and heuristic criteria
Résumé
This report was done during the Semaine d' Études Mathématiques et Entreprises (SEME) at the Institut de recherche mathématique de Rennes (IRMAR). The subject, proposed by the research centers Cenearo and IRT Saint Exupéry, is about the characterization of optimization problems which can only be tested under a black-box procedure. We propose some selection criteria in order to categorize such problems.
Origine | Fichiers produits par l'(les) auteur(s) |
---|