The oracle Complexity of Smooth Convex Optimization in Nonstandard Settings

First-order convex minimization algorithms are currently the methods of choice for large-scale sparse – and more generally parsimonious – regression models. We pose the question on the limits of per