32 citations · 87 across the 18 of their papers we have counts for
19 papers
Complexity results and active-set identification of a derivative-free method for bound-constrained problems
Andrea Brilli, Andrea Cristofari, Giampaolo Liuzzi +1
In this paper, we analyze a derivative-free line search method designed for bound-constrained problems. Our analysis demonstrates that this method exhibits a worst-case complexity…
Worst case complexity bounds for linesearch-type derivative-free algorithms
Andrea Brilli, Morteza Kimiaei, Giampaolo Liuzzi +1
This paper is devoted to the analysis of worst case complexity bounds for linesearch-type derivative-free algorithms for the minimization of general non-convex smooth functions. We…
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization
Manlio Gaudioso, Giampaolo Liuzzi, Stefano Lucidi
In this paper we propose an heuristic to improve the performances of the recently proposed derivative-free method for nonsmooth optimization CS-DFN. The heuristic is based on a clu…
A derivative-free approach to mixed integer constrained multiobjective nonsmooth optimization
Giampaolo Liuzzi, Stefano Lucidi
In this work, we consider multiobjective optimization problems with both bound constraints on the variables and general nonlinear constraints, where objective and constraint functi…
An interior point method for nonlinear constrained derivative-free optimization
Andrea Brilli, Giampaolo Liuzzi, Stefano Lucidi
In this paper we consider constrained optimization problems where both the objective and constraint functions are of the black-box type. Furthermore, we assume that the nonlinear i…
Minimization over the l1-ball using an active-set non-monotone projected gradient
Andrea Cristofari, Marianna De Santis, Stefano Lucidi +1
The l1-ball is a nicely structured feasible set that is widely used in many fields (e.g., machine learning, statistics and signal analysis) to enforce some sparsity in the model so…