32 citations · 87 across the 18 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.OC2023★ 3 cited
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…
math.OC2023
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…