3 citations · 3 across the 3 of their papers we have counts for
3 papers
math.OC2025
Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
Francesco Cecere, Matteo Lapucci, Davide Pucci +1
In this paper, we consider the problem of minimizing a smooth function, given as finite sum of black-box functions, over a convex set. In order to advantageously exploit the struct…
math.OC2024★ 3 cited
A Globally Convergent Gradient Method with Momentum
Matteo Lapucci, Giampaolo Liuzzi, Stefano Lucidi +2
In this work, we consider smooth unconstrained optimization problems and we deal with the class of gradient methods with momentum, i.e., descent algorithms where the search directi…
math.OC2021
A Unifying Framework for Sparsity Constrained Optimization
M. Lapucci, T. Levato, F. Rinaldi +1
In this paper, we consider the optimization problem of minimizing a continuously differentiable function subject to both convex constraints and sparsity constraints. By exploiting…