Efficient search strategies for constrained multiobjective blackbox optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915226522222592 |
|---|---|
| author | Digabel, Sébastien Le Lesage-Landry, Antoine Salomon, Ludovic Tribes, Christophe |
| author_facet | Digabel, Sébastien Le Lesage-Landry, Antoine Salomon, Ludovic Tribes, Christophe |
| contents | Multiobjective blackbox optimization deals with problems where the objective and constraint functions are the outputs of a numerical simulation. In this context, no derivatives are available, nor can they be approximated by finite differences, which precludes the use of classical gradient-based techniques. The DMulti-MADS algorithm implements a state-of-the-art direct search procedure for multiobjective blackbox optimization based on the mesh adaptive direct search (MADS) algorithm. Since its conception, many search strategies have been proposed to improve the practical efficiency of the single-objective MADS algorithm. Inspired by this previous research, this work proposes the integration of two search heuristics into the DMulti-MADS algorithm. The first uses quadratic models, built from previously evaluated points, which act as surrogates for the true objectives and constraints, to suggest new promising candidates. The second exploits the sampling strategy of the Nelder-Mead algorithm to explore the decision space for new non-dominated points. Computational experiments on analytical problems and three engineering applications show that the use of such search steps considerably improves the performance of the DMulti-MADS algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_02986 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient search strategies for constrained multiobjective blackbox optimization Digabel, Sébastien Le Lesage-Landry, Antoine Salomon, Ludovic Tribes, Christophe Optimization and Control Multiobjective blackbox optimization deals with problems where the objective and constraint functions are the outputs of a numerical simulation. In this context, no derivatives are available, nor can they be approximated by finite differences, which precludes the use of classical gradient-based techniques. The DMulti-MADS algorithm implements a state-of-the-art direct search procedure for multiobjective blackbox optimization based on the mesh adaptive direct search (MADS) algorithm. Since its conception, many search strategies have been proposed to improve the practical efficiency of the single-objective MADS algorithm. Inspired by this previous research, this work proposes the integration of two search heuristics into the DMulti-MADS algorithm. The first uses quadratic models, built from previously evaluated points, which act as surrogates for the true objectives and constraints, to suggest new promising candidates. The second exploits the sampling strategy of the Nelder-Mead algorithm to explore the decision space for new non-dominated points. Computational experiments on analytical problems and three engineering applications show that the use of such search steps considerably improves the performance of the DMulti-MADS algorithm. |
| title | Efficient search strategies for constrained multiobjective blackbox optimization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2504.02986 |