On Parallel Complexity of Nonsmooth Convex Optimization

By Arkadi Nemirovski. 1994

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. H. Brendan McMahan
2. Blake E. Woodworth
3. Jakub Konecný
4. Nati Srebro
5. Jialei Wang
6. Zeyuan Allen-Zhu
7. John C. Duchi
8. Sebastian U. Stich

Citations in the corpus

• Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization (2018, background): “Nemirovski [19] studied non-smooth optimization in the case that the dimension is bounded, proving lower bounds in this setting that scale with the 1/3-power of the dimension but have only logarithmic dependence on the suboptimality.”
• Lower bounds for non-convex stochastic optimization (2019, background): “2 See also the K -parallel model of [35].”