The First Optimal Algorithm for Smooth and Strongly-Convex-Strongly-Concave Minimax Optimization

Zhang et al. (2021) and Ibrahim et al. (2020) established However, the existing state-of-the-art methods do not match this lower bound: algorithms of Lin et al. (2020) It is worth mentioning that this open question was answered positively in the works of Kovalev et al. Most existing works on minimax optimization study the convex-concave case.