Handling of constraints in multiobjective blackbox optimization - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computational Optimization and Applications Année : 2024

Handling of constraints in multiobjective blackbox optimization

Résumé

This work proposes the integration of two new constraint-handling approaches into the blackbox constrained multiobjective optimization algorithm DMulti-MADS, an extension of the Mesh Adaptive Direct Search (MADS) algorithm for single-objective constrained optimization. The constraints are aggregated into a single constraint violation function which is used either in a two-phase approach, where the search for a feasible point is prioritized if not available before improving the current solution set, or in a progressive barrier approach, where any trial point whose constraint violation function values are above a threshold are rejected. This threshold is progressively decreased along the iterations. As in the singleobjective case, it is proved that these two variants generate feasible and/or infeasible sequences which converge either in the feasible case to a set of local Pareto optimal points or in the infeasible case to Clarke stationary points according to the constraint violation function. Computational experiments show that these two approaches are competitive with other state-of-the-art algorithms.

Fichier principal
Vignette du fichier
DMulti_MADS_PB propriete.pdf (2.2 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04684390 , version 1 (02-09-2024)

Identifiants

Citer

Jean Bigeon, Sébastien Le Digabel, Ludovic Salomon. Handling of constraints in multiobjective blackbox optimization. Computational Optimization and Applications, 2024, 89 (1), pp.69-113. ⟨10.1007/s10589-024-00588-2⟩. ⟨hal-04684390⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More