# Tight Complexity Bounds for Optimizing Composite Objectives

Blake E. WoodworthNati Srebro

We provide tight upper and lower bounds on the complexity of minimizing the average of m convex functions using gradient and prox oracles of the component functions. We show a significant gap between the complexity of deterministic vs randomized optimization... (read more)

PDF Abstract