  We prove that the iterates produced by, either the scalar step size variant,
or the coordinatewise variant of AdaGrad algorithm, are convergent sequences
when applied to convex objective functions with Lipschitz gradient. The key
insight is to remark that such AdaGrad sequences satisfy a variable metric
quasi-Fej\'er monotonicity property, which allows to prove convergence.
