8 citations · 9 across the 5 of their papers we have counts for
5 papers
Iterative Minimax Games with Coupled Linear Constraints
Huiling Zhang, Zi Xu, Yu-Hong Dai
The study of nonconvex minimax games has gained significant momentum in machine learning and decision science communities due to their fundamental connections to adversarial traini…
Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems
Zi Xu, Zi-Qi Wang, Jun-Lin Wang +1
In this paper, we consider a class of nonconvex-nonconcave minimax problems, i.e., NC-PL minimax problems, whose objective functions satisfy the Polyak-Łojasiewicz (PL) condition w…
On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems
Na Huang, Yu-Hong Dai, Dominique Orban +1
We consider the generalized successive overrelaxation (GSOR) method for solving a class of block three-by-three saddle-point problems. Based on the necessary and sufficient conditi…
A semi-conjugate gradient method for solving unsymmetric positive definite linear systems
Na Huang, Yu-Hong Dai, Dominique Orban +1
The conjugate gradient (CG) method is a classic Krylov subspace method for solving symmetric positive definite linear systems. We introduce an analogous semi-conjugate gradient (SC…
Optimality Conditions and Numerical Algorithms for A Class of Linearly Constrained Minimax Optimization Problems
Yu-Hong Dai, Jiani Wang, Liwei Zhang
It is well known that there have been many numerical algorithms for solving nonsmooth minimax problems, numerical algorithms for nonsmooth minimax problems with joint linear constr…