Parametric complexity analysis for a class of first-order Adagrad-like algorithms