World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
35
Citations
12162
World Ranking
2710
National Ranking
1108

Overview

Guanghui Lan is affiliated with the Georgia Institute of Technology in the United States. The scientist's research primarily spans fields such as Computer Science and Engineering, with a focus on subfields including Artificial Intelligence, Computational Mechanics, Management Science and Operations Research, Numerical Analysis, and Computational Theory and Mathematics.

The main topics of their work include Stochastic Gradient Optimization Techniques, Sparse and Compressive Sensing Techniques, Advanced Optimization Algorithms Research, Reinforcement Learning in Robotics, Optimization and Variational Analysis, Risk and Portfolio Optimization, and Machine Learning and Algorithms.

Guanghui Lan has authored numerous papers, contributing especially to venues like arXiv (Cornell University), Mathematical Programming, SIAM Journal on Optimization, Computational Optimization and Applications, and SIAM Journal on Control and Optimization. Notable recent papers include:

  • Policy mirror descent for reinforcement learning: linear convergence, new sampling complexity, and generalized problem classes, 2022, Mathematical Programming
  • Stochastic first-order methods for convex and nonconvex functional constrained optimization, 2022, Mathematical Programming
  • Revolutionizing Membrane Design Using Machine Learning-Bayesian Optimization, 2021, Environmental Science & Technology
  • Dynamically Controlled Environment Agriculture: Integrating Machine Learning and Mechanistic and Physiological Models for Sustainable Food Cultivation, 2021, ACS ES&T Engineering
  • Complexity of training ReLU neural network, 2020, Discrete Optimization

The scientist has collaborated frequently with a core group of coauthors, including Tianjiao Li, Yan Li, Georgios Kotsalis, Digvijay Boob, and Yuyuan Ouyang.

In addition to journal publications, Guanghui Lan has contributed to book literature. A notable book titled First-order and Stochastic Optimization Methods for Machine Learning was published by Springer International Publishing in 2020.

Best Publications

  • Robust Stochastic Approximation Approach to Stochastic Programming

    A. Nemirovski;A. Juditsky;G. Lan;A. Shapiro

  • Stochastic Approximation approach to Stochastic Programming

    Anatoli Juditsky;Guanghui Lan;Arkadii S. Nemirovski;Alexander Shapiro

  • Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming

    Saeed Ghadimi;Guanghui Lan

  • Accelerated gradient methods for nonconvex nonlinear and stochastic programming

    Saeed Ghadimi;Guanghui Lan

  • An optimal method for stochastic composite optimization

    Guanghui Lan

  • Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization

    Saeed Ghadimi;Guanghui Lan;Hongchao Zhang

  • Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework

    Saeed Ghadimi;Guanghui Lan

  • First-order and Stochastic Optimization Methods for Machine Learning

    Guanghui Lan

  • Optimal Primal-Dual Methods for a Class of Saddle Point Problems

    Yunmei Chen;Guanghui Lan;Yuyuan Ouyang

  • An Accelerated Linearized Alternating Direction Method of Multipliers

    Yuyuan Ouyang;Yunmei Chen;Guanghui Lan;Eduardo Pasiliao

  • Communication-efficient algorithms for decentralized and stochastic optimization

    Guanghui Lan;Soomin Lee;Yi Zhou

  • An optimal randomized incremental gradient method

    Guanghui Lan;Yi Zhou

  • An effective and simple heuristic for the set covering problem

    Guanghui Lan;Gail W. DePuy;Gary E. Whitehouse

  • Primal-dual first-order methods with $${\mathcal {O}(1/psilon)}$$iteration-complexity for cone programming

    Guanghui Lan;Zhaosong Lu;Renato D. C. Monteiro

  • Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms

    Saeed Ghadimi;Guanghui Lan

  • Validation analysis of mirror descent stochastic approximation method

    Guanghui Lan;Arkadi Nemirovski;Alexander Shapiro

  • Conditional Gradient Sliding for Convex Optimization

    Guanghui Lan;Yi Zhou

  • The Complexity of Large-scale Convex Programming under a Linear Optimization Oracle

    Guanghui Lan

  • Iteration-complexity of first-order augmented Lagrangian methods for convex programming

    Guanghui Lan;Renato D. Monteiro

  • Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization

    Cong D. Dang;Guanghui Lan

  • Accelerated schemes for a class of variational inequalities

    Yunmei Chen;Guanghui Lan;Yuyuan Ouyang

Frequent Co-Authors

Renato D. C. Monteiro
Renato D. C. Monteiro Georgia Institute of Technology
Yunmei Chen
Yunmei Chen University of Florida
Yingbin Liang
Yingbin Liang The Ohio State University
Alexander Shapiro
Alexander Shapiro Georgia Institute of Technology
Arkadi Nemirovski
Arkadi Nemirovski Georgia Institute of Technology
Anatoli Juditsky
Anatoli Juditsky Grenoble Alpes University
Yongsheng Chen
Yongsheng Chen Nankai University
Shabbir Ahmed
Shabbir Ahmed Georgia Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics, exploring related online degrees can open diverse career opportunities. Many students consider advanced business education, such as an MBA, to complement their analytical skills. If you’re looking for flexibility, can you transfer MBA programs offers valuable insights into credits transferability, making it easier to continue your education without losing previous coursework.

Data analytics is another thriving field that heavily relies on mathematical foundations. Pursuing one of the data analysis programs can sharpen your skills in interpreting complex data sets, preparing you for roles in technology, finance, healthcare, and more.

For those worried about admission challenges, several schools offer easiest MBA specialization paths, allowing students to smoothly transition into graduate studies. Additionally, identifying the easiest MBA programs can help reduce barriers to entry while providing valuable credentials.

Understanding these options allows Mathematics students to diversify their qualifications and enhance career prospects through flexible, accessible online programs.

Best Scientists Citing Guanghui Lan

Trending Scientists