activity
20192026
most citedParallel Strategies for Direct Multisearch

2 citations · 4 across the 7 of their papers we have counts for

collaborators

7 papers

math.OC2026

Exploring polynomial models in the Search Step of Direct Multisearch

Ana Luísa Custódio, Marta Pozzi, Everton José da Silva

Direct Multisearch (DMS) is a class of direct-search algorithms designed for multiobjective derivative-free optimization. Its framework consists of an optional search step and a po…

math.OC2025

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search

Andrea Brilli, Ana L. Custódio, Giampaolo Liuzzi +1

In this work, we propose the joint use of a mixed penalty-interior point method and direct search, for addressing nonlinearly constrained derivative-free optimization problems. A m…

math.OC2024

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search

Andrea Brilli, Ana L. Custódio, Giampaolo Liuzzi +1

In this work, the joint use of a mixed penalty-interior point method and direct search is proposed, to address {nonlinear} constrained derivative-free optimization problems. A meri…

math.OC2024★ 2 cited

An Inexact Restoration Direct Multisearch Filter Approach to Multiobjective Constrained Derivative-free Optimization

Everton J. Silva, Ana Luísa Custódio

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

math.OC2021★ 2 cited

Parallel Strategies for Direct Multisearch

S. Tavares, C. P. Brás, A. L. Custódio +2

Direct Multisearch (DMS) is a Derivative-free Optimization class of algorithms suited for computing approximations to the complete Pareto front of a given Multiobjective Optimizati…

math.OC2020

Using first-order information in Direct Multisearch for multiobjective optimization

R. Andreani, A. L. Custódio, M. Raydan

Derivatives are an important tool for single-objective optimization. In fact, it is commonly accepted that derivative-based methods present a better performance than derivative-fre…

math.OC2019

Worst-case Complexity Bounds of Directional Direct-search Methods for Multiobjective Optimization

A. L. Custódio, Y. Diouane, R. Garmanjani +1

Direct Multisearch is a well-established class of algorithms, suited for multiobjective derivative-free optimization. In this work, we analyze the worst-case complexity of this cla…