In my talk, I will explain the approach of finding solutions to nonlinear PDEs via tug-of-war games. I will focus on the context of p-Laplacian and the non-local geometric p-Laplacian. Zoom meeting: Link

In a Hilbert space, for convex optimization, we report on recent advances regarding the acceleration of first-order algorithms. We rely on inertial dynamics with damping driven by the Hessian, and the link between continuous dynamic systems and algorithms obtained by temporal discretization. We first review the classical results, from Polyak's heavy ball with friction method…

We survey the known results concerning the minimal Riesz energy on sufficiently smooth sets, and present some new results on fractal sets, which are the key examples of non-rectifiable sets. In particular, we will talk about the connection of these problems to ergodic theory and probability theory: the key step in our proofs is applying…

A popular method to approximate a fixed point of a non-expansive map is C is the Krasnoselskii-Mann iteration. This covers a wide range of iterative methods in convex minimization, equilibria, and beyond. In the Euclidean setting, a flexible method to obtain convergence rates for this iteration is the PEP methodology introduced by Drori and Teboulle…