10 citations · 14 across the 23 of their papers we have counts for
4 papers · 1 filter
Beyond the Worst Case: Semi-Random Complexity Analysis of Winner Determination
Lirong Xia, Weiqiang Zheng
The computational complexity of winner determination is a classical and important problem in computational social choice. Previous work based on worst-case analysis has established…
Accelerated Single-Call Methods for Constrained Min-Max Optimization
Yang Cai, Weiqiang Zheng
We study first-order methods for constrained min-max optimization. Existing methods either require two gradient calls or two projections in each iteration, which may be costly in s…
Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
Yang Cai, Argyris Oikonomou, Weiqiang Zheng
We study constrained comonotone min-max optimization, a structured class of nonconvex-nonconcave min-max optimization problems, and their generalization to comonotone inclusion. In…
Tight Last-Iterate Convergence of the Extragradient and the Optimistic Gradient Descent-Ascent Algorithm for Constrained Monotone Variational Inequalities
Yang Cai, Argyris Oikonomou, Weiqiang Zheng
The monotone variational inequality is a central problem in mathematical programming that unifies and generalizes many important settings such as smooth convex optimization, two-pl…