13 citations · 43 across the 11 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2021★ 3 cited
Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization
Luo Luo, Guangzeng Xie, Tong Zhang +1
This paper considers stochastic first-order algorithms for convex-concave minimax problems of the form , where can be presented by the…
math.OC2021★ 13 cited
Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction
Yuze Han, Guangzeng Xie, Zhihua Zhang
In this paper, we study the lower complexity bounds for finite-sum optimization problems, where the objective is the average of individual component functions. We consider Prox…
math.OC2019★ 3 cited
A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization
Guangzeng Xie, Luo Luo, Zhihua Zhang
This paper studies the lower bound complexity for the optimization problem whose objective function is the average of individual smooth convex functions. We consider the algori…