Showing math.OCShow all
2 papers · 1 filter
math.OC2025
Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis
Jiajin Li, Linglingzhi Zhu, Anthony Man-Cho So
Nonconvex-nonconcave minimax optimization has gained widespread interest over the last decade. However, most existing works focus on variants of gradient descent-ascent (GDA) algor…
math.OC2024
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…