10 citations · 22 across the 8 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2023★ 4 cited
Convex and Non-convex Optimization Under Generalized Smoothness
Haochuan Li, Jian Qian, Yi Tian +2
Classical analysis of convex and non-convex optimization methods often requires the Lipshitzness of the gradient, which limits the analysis to functions bounded by quadratics. Rece…
math.OC2021★ 10 cited
Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization
Haochuan Li, Yi Tian, Jingzhao Zhang +1
We provide a first-order oracle complexity lower bound for finding stationary points of min-max optimization problems where the objective function is smooth, nonconvex in the minim…