I thank Prof. Peter Sin for his valuable suggestions and feedback. I am grateful to Prof. David Saunders for providing computational data.
In this paper, we consider a class of finite-sum convex optimization problems whose objective function is given by the summation of $m$ ($\ge 1$) smooth components together with some other relatively simple terms. We first introduce a deterministic …
There aren't more papers