3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.OC2023★ 3 cited
Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity
Xiao Li, Lei Zhao, Daoli Zhu +1
The subgradient method is one of the most fundamental algorithmic schemes for nonsmooth optimization. The existing complexity and convergence results for this method are mainly der…
math.OC2022
Randomized Coordinate Subgradient Method for Nonsmooth Composite Optimization
Lei Zhao, Ding Chen, Daoli Zhu +1
Coordinate-type subgradient methods for addressing nonsmooth optimization problems are relatively underexplored due to the set-valued nature of the subdifferential. In this work, o…