Robust stochastic approximation approach to stochastic programming A Nemirovski, A Juditsky, G Lan, A Shapiro SIAM Journal on optimization 19 (4), 1574-1609, 2009 | 2695 | 2009 |
Stochastic first-and zeroth-order methods for nonconvex stochastic programming S Ghadimi, G Lan SIAM journal on optimization 23 (4), 2341-2368, 2013 | 1559 | 2013 |
Accelerated gradient methods for nonconvex nonlinear and stochastic programming S Ghadimi, G Lan Mathematical Programming 156 (1), 59-99, 2016 | 627 | 2016 |
An optimal method for stochastic composite optimization G Lan Mathematical Programming 133 (1), 365-397, 2012 | 595 | 2012 |
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization S Ghadimi, G Lan, H Zhang Mathematical Programming 155 (1), 267-305, 2016 | 495 | 2016 |
Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, I: a Generic Algorithmic Framework S Ghadimi, G Lan | 403* | |
First-order and stochastic optimization methods for machine learning G Lan Springer, 2020 | 377 | 2020 |
Optimal primal-dual methods for a class of saddle point problems Y Chen, G Lan, Y Ouyang SIAM Journal on Optimization 24 (4), 1779-1814, 2014 | 266 | 2014 |
An accelerated linearized alternating direction method of multipliers Y Ouyang, Y Chen, G Lan, E Pasiliao Jr SIAM Journal on Imaging Sciences 8 (1), 644-681, 2015 | 257 | 2015 |
An optimal randomized incremental gradient method G Lan, Y Zhou Mathematical programming 171, 167-215, 2018 | 251 | 2018 |
Communication-efficient algorithms for decentralized and stochastic optimization G Lan, S Lee, Y Zhou Mathematical Programming 180 (1), 237-284, 2020 | 245 | 2020 |
Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms S Ghadimi, G Lan Manuscript, Department of Industrial and Systems Engineering, University of …, 0 | 228* | |
An effective and simple heuristic for the set covering problem G Lan, GW DePuy, GE Whitehouse European journal of operational research 176 (3), 1387-1403, 2007 | 227 | 2007 |
Primal-dual first-order methods with iteration-complexity for cone programming G Lan, Z Lu, RDC Monteiro Mathematical Programming 126 (1), 1-29, 2011 | 214 | 2011 |
Conditional gradient sliding for convex optimization G Lan, Y Zhou SIAM Journal on Optimization 26 (2), 1379-1409, 2016 | 171 | 2016 |
Validation analysis of mirror descent stochastic approximation method G Lan, A Nemirovski, A Shapiro Mathematical programming 134 (2), 425-458, 2012 | 166 | 2012 |
Accelerated schemes for a class of variational inequalities Y Chen, G Lan, Y Ouyang Mathematical Programming 165, 113-149, 2017 | 147 | 2017 |
Iteration-complexity of first-order augmented Lagrangian methods for convex programming G Lan, RDC Monteiro Mathematical Programming 155 (1), 511-547, 2016 | 137 | 2016 |
The complexity of large-scale convex programming under a linear optimization oracle G Lan arXiv preprint arXiv:1309.5550, 2013 | 137 | 2013 |
Policy mirror descent for reinforcement learning: Linear convergence, new sampling complexity, and generalized problem classes G Lan Mathematical programming 198 (1), 1059-1106, 2023 | 131 | 2023 |