11 citations · 19 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.OC2021★ 3 cited
On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions
Lai Tian, Kaiwen Zhou, Anthony Man-Cho So
We report a practical finite-time algorithmic scheme to compute approximately stationary points for nonconvex nonsmooth Lipschitz functions. In particular, we are interested in two…
math.OC2021★ 2 cited
Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums
Kaiwen Zhou, Lai Tian, Anthony Man-Cho So +1
In convex optimization, the problem of finding near-stationary points has not been adequately studied yet, unlike other optimality measures such as the function value. Even in the…