J. Peypouquet

activity

20092026

most citedThe rate of convergence of Nesterov's accelerated forward-backward method is actually faster than

1/ k^{2}

286 citations · 522 across the 27 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.OC2015★ 286 cited

The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than $1/ k^{2}$

Hedy Attouch, Juan Peypouquet

The {\it forward-backward algorithm} is a powerful tool for solving optimization problems with a {\it additively separable} and {\it smooth} + {\it nonsmooth} structure. In the con…

math.OC2015

From error bounds to the complexity of first-order descent methods for convex functions

Jérôme Bolte, Trong Phong Nguyen, Juan Peypouquet +1

This paper shows that error bounds can be used as effective tools for deriving complexity results for first-order descent methods in convex minimization. In a first stage, this obj…

math.OC2015

Fast Convergence of an Inertial Gradient-like System with Vanishing Viscosity

Hedy Attouch, Juan Peypouquet, Patrick Redont

In a real Hilbert space $H$ , we study the fast convergence properties as $t \to + \infty$ of the trajectories of the second-order evolution equation $$ \ddot{x}(t) + \frac…

The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than 1/k2

From error bounds to the complexity of first-order descent methods for convex functions

Fast Convergence of an Inertial Gradient-like System with Vanishing Viscosity

The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than $1/ k^{2}$