An optimal algorithm for convex minimization problems with nonconstant step-sizes
An optimal algorithm for convex minimization problems with nonconstant step-sizes
In this section, we recall some notations and properties of differentiable convex functions, differentiable functions that the gradient vectors are Lipschitz contiuous. These notations and properties are used in the proofs of main results in this paper.