Optimal levaraging of strong convexity and smoothness for splitting algorithms

Quand : 19 juin 2026 à 10:00

Où : XLIM

Organisé par : Institut Henri Poincaré

In this talk, we establish a tight optimal linear convergence rates for a class of strongly convex optimization problems involving two functions, at least one of which is smooth. Our approach consists of applying the classical splitting algorithms (including proximal-gradient, FISTA, and Peaceman-Rachford algorithms) to an equivalent modified optimization problem with adjustable levels of strong c