activity
20202026
most citedModular-proximal gradient algorithms in variable exponent Lebesgue spaces

5 citations · 6 across the 8 of their papers we have counts for

collaborators

8 papers

math.OC2026

Relax and Follow: L0-Path Computation with L0-Bregman Relaxations

Mhamed Essafri, Luca Calatroni, Emmanuel Soubies

This work introduces L0PathBrex, a novel method for estimating the solution path of L0-regularized problems through the use of L0 Bregman relaxations (B-rex). Recently introduced a…

math.NA2024

Off-the-grid regularisation for Poisson inverse problems

Marta Lazzaretti, Claudio Estatico, Alejandro Melero +1

Off-the-grid regularisation has been extensively employed over the last decade in the context of ill-posed inverse problems formulated in the continuous setting of the space of Rad…

math.OC2023

Parameter-Free FISTA by Adaptive Restart and Backtracking

Jean-François Aujol, Luca Calatroni, Charles Dossal +2

We consider a combined restarting and adaptive backtracking strategy for the popular Fast Iterative Shrinking-Thresholding Algorithm frequently employed for accelerating the conver…

math.OC2023

Stochastic gradient descent for linear inverse problems in variable exponent Lebesgue spaces

Marta Lazzaretti, Zeljko Kereta, Luca Calatroni +1

We consider a stochastic gradient descent (SGD) algorithm for solving linear inverse problems (e.g., CT image reconstruction) in the Banach space framework of variable exponent Leb…

math.OC2021★ 5 cited

Modular-proximal gradient algorithms in variable exponent Lebesgue spaces

Marta Lazzaretti, Luca Calatroni, Claudio Estatico

We consider structured optimisation problems defined in terms of the sum of a smooth and convex function, and a proper, l.s.c., convex (typically non-smooth) one in reflexive varia…

math.OC2021

A scaled, inexact and adaptive Fast Iterative Soft-Thresholding Algorithm for convex image restoration

Luca Calatroni, Simone Rebegoldi

In this note, we consider a special instance of the scaled, inexact and adaptive generalised Fast Iterative Soft-Thresholding Algorithm (SAGE-FISTA) recently proposed in (Rebegoldi…

math.OC2021

Scaled, inexact and adaptive generalized FISTA for strongly convex optimization

Simone Rebegoldi, Luca Calatroni

We consider a variable metric and inexact version of the FISTA-type algorithm considered in (Chambolle, Pock, 2016, Calatroni, Chambolle, 2019) for the minimization of the sum of t…

eess.IV2020★ 1 cited

Weighted-CEL0 sparse regularisation for molecule localisation in super-resolution microscopy with Poisson data

Marta Lazzaretti, Luca Calatroni, Claudio Estatico

We propose a continuous non-convex variational model for Single Molecule Localisation Microscopy (SMLM) super-resolution in order to overcome light diffraction barriers. Namely, we…