82 citations · 546 across the 65 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.OC2015★ 5 cited
Randomized Block Subgradient Methods for Convex Nonsmooth and Stochastic Optimization
Qi Deng, Guanghui Lan, Anand Rangarajan
Block coordinate descent methods and stochastic subgradient methods have been extensively studied in optimization and machine learning. By combining randomized block sampling with…
math.OC2015★ 13 cited
Generalized Uniformly Optimal Methods for Nonlinear Programming
Saeed Ghadimi, Guanghui Lan, Hongchao Zhang
In this paper, we present a generic framework to extend existing uniformly optimal convex programming algorithms to solve more general nonlinear, possibly nonconvex, optimization p…
math.OC2015★ 35 cited
An optimal randomized incremental gradient method
Guanghui Lan, Yi Zhou
In this paper, we consider a class of finite-sum convex optimization problems whose objective function is given by the summation of () smooth components together with so…