Guanghui Lan - Citegraph

Author Info

Name	Affiliation	Papers
GUANGHUI LAN	School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, NW, Atlanta, GA 30332-0205, USA	46
Collaborators	Citations	PageRank
52	1212	66.26
Referers	Referees	References
1908	468	502

Search Limit

1001000

Publications (46 rows)

Collaborators (52 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Accelerated gradient sliding for structured convex optimization	0	0.34	2022
Complexity of training ReLU neural network	0	0.34	2022
Correction to: Complexity of stochastic dual dynamic programming	0	0.34	2022
SIMPLE AND OPTIMAL METHODS FOR STOCHASTIC VARIATIONAL INEQUALITIES, II: MARKOVIAN NOISE AND POLICY EVALUATION IN REINFORCEMENT LEARNING	0	0.34	2022
GLAD: Learning Sparse Graph Recovery	1	0.35	2020
A Feasible Level Proximal Point Method For Nonconvex Sparse Constrained Optimization	0	0.34	2020
Algorithms for stochastic optimization with function or expectation constraints	3	0.42	2020
A note on inexact gradient and Hessian conditions for cubic regularized Newton’s method	1	0.36	2019
Fast bundle-level methods for unconstrained and ball-constrained convex optimization	0	0.34	2019
A unified variance-reduced accelerated gradient method for convex optimization.	0	0.34	2019
Generalized Uniformly Optimal Methods for Nonlinear Programming	6	0.48	2019
Accelerated Stochastic Algorithms for Nonconvex Finite-Sum and Multiblock Optimization	3	0.39	2019
Optimal Adaptive and Accelerated Stochastic Gradient Descent.	0	0.34	2018
Cubic Regularization with Momentum for Nonconvex Optimization.	0	0.34	2018
Sample Complexity of Stochastic Variance-Reduced Cubic Regularization for Nonconvex Optimization.	1	0.38	2018
Complexity of Training ReLU Neural Network.	0	0.34	2018
Asynchronous Decentralized Accelerated Stochastic Gradient Descent	0	0.34	2018
A Note on Inexact Condition for Cubic Regularized Newton's Method.	0	0.34	2018
Conditional Accelerated Lazy Stochastic Gradient Descent.	2	0.41	2017
Communication-Efficient Algorithms for Decentralized and Stochastic Optimization.	24	0.74	2017
Accelerated Schemes For A Class of Variational Inequalities	5	0.47	2017
Random Gradient Extrapolation for Distributed and Stochastic Optimization	1	0.35	2017
Theoretical properties of the global optimizer of two layer neural network.	0	0.34	2017
Dynamic Stochastic Approximation For Multi-Stage Stochastic Optimization	0	0.34	2017
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization.	70	1.87	2016
Iteration-complexity of first-order augmented Lagrangian methods for convex programming.	17	0.82	2016
Gradient Sliding for Composite Optimization	4	0.43	2016
Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programming	85	2.50	2016
CONDITIONAL GRADIENT SLIDING FOR CONVEX OPTIMIZATION	19	0.77	2016
Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization	9	0.60	2015
An optimal randomized incremental gradient method	31	1.14	2015
Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization	19	0.84	2015
An Accelerated Linearized Alternating Direction Method of Multipliers.	9	0.51	2015
On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators	9	0.58	2015
Optimal Primal-Dual Methods for a Class of Saddle Point Problems.	35	1.13	2014
A linearly convergent first-order algorithm for total variation minimisation in image processing	1	0.37	2014
Iteration-complexity of first-order penalty methods for convex programming.	13	1.22	2013
Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming.	99	3.26	2013
Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework.	71	3.28	2012
An optimal method for stochastic composite optimization	51	5.98	2012
Validation analysis of mirror descent stochastic approximation method.	39	2.33	2012
Primal-dual first-order methods with O(1/e) iteration-complexity for cone programming.	2	0.37	2011
Robust Stochastic Approximation Approach to Stochastic Programming	508	26.07	2009
A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming	2	0.40	2009
An effective and simple heuristic for the set covering problem	56	1.93	2007
On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem	16	0.78	2006