The context of this research is multiobjective optimization where conflicting objectives are
present. In this work, these objectives are only available as the outputs of a blackbox for …

This paper uses an augmented Lagrangian method based on an inexact exponential
penalty function to solve constrained multiobjective optimization problems. Two algorithms …

In this paper we handle the problem of filling the hole in the graphic of a surface by means of
a patch that joins the original surface with C 1-smoothness and fulfills an additional non …

In this article, we propose an adaptation of the Hyperbolic Augmented Lagrangian algorithm
to solve multiobjective optimization problems. After conducting a literature review, we …

This work proposes the integration of two new constraint-handling approaches into the
blackbox constrained multiobjective optimization algorithm DMulti-MADS, an extension of …

Direct multisearch (DMS) is a derivative-free optimization class of algorithms, suited for
computing approximations to the complete Pareto front of a given multiobjective optimization …

Although many algorithms have been proposed to solve multiobjective optimization
problems, how to balance convergence and diversity of population is still a challenge …

Direct Multisearch (DMS) is a well-established class of methods for multiobjective derivative-
free optimization, where constraints are addressed by an extreme barrier approach, only …

This dissertation is framed on the ongoing research project BoostDFO-Improving the
performance and moving to newer dimensions in Derivative-Free Optimization. The final …

We propose a method for solving multiobjective optimization problems under the constraints
of inequality. In this method, the initial problem is transformed into a single-objective …