Handling of constraints in multiobjective blackbox optimization

DOI10.1007/s10589-024-00588-2MaRDI QIDQ6606851

Ludovic Salomon, Sébastien Le Digabel, Jean Bigeon

Publication date: 17 September 2024

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

constrained optimizationmultiobjective optimizationmultiple objective programmingderivative-free optimizationblackbox optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• A Bayesian approach to constrained single- and multi-objective optimization
• Derivative-free methods for nonlinear programming with general lower-level constraints
• Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
• Multiobjective optimization. Interactive and evolutionary approaches
• Globalization strategies for mesh adaptive direct search
• Nonlinear multiobjective optimization
• A progressive barrier derivative-free trust-region algorithm for constrained optimization
• Mesh-based Nelder-Mead algorithm for inequality constrained optimization
• MultiGLODS: global and local multiobjective optimization using direct search
• On the use of polynomial models in multiobjective directional direct search
• Performance indicators in multiobjective optimization
• DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
• A mesh adaptive direct search algorithm for multiobjective optimization
• Multi-objective evolutionary optimization algorithms for machine learning: a recent survey
• A Method for Constrained Multiobjective Optimization Based on SQP Techniques
• Algorithm 909
• Direct Multisearch for Multiobjective Optimization
• A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization
• Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
• Introduction to the Theory of Nonlinear Optimization
• OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
• Multiobjective Optimization Through a Series of Single-Objective Formulations
• Introduction to Derivative-Free Optimization
• Derivative-Free and Blackbox Optimization
• The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
• A Pattern Search Filter Method for Nonlinear Programming without Derivatives
• On the Global Convergence of a Filter--SQP Algorithm
• Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
• A Derivative-Free Algorithm for Inequality Constrained Nonlinear Programming via Smoothing of an $\ell_\infty$ Penalty Function
• A Progressive Barrier for Derivative-Free Nonlinear Programming
• Derivative-free optimization methods
• A Merit Function Approach for Direct Search
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• Nonlinear programming without a penalty function.
• A taxonomy of constraints in black-box simulation-based optimization

This page was built for publication: Handling of constraints in multiobjective blackbox optimization