# The Complexity of Min-Max Optimization with Product Constraints

arXiv: https://arxiv.org/abs/2602.04665 · HTML: https://mlsanity.com/paper/2602.04665/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Feb 2026.

## Built on by (most cited first, 2 of 2)

- [Min-Max Optimization Requires Exponentially Many Queries](https://mlsanity.com/paper/2605.13806/) (2026)
- [The Complexity of Min-Max Optimization for Quadratic Polynomials](https://mlsanity.com/paper/2606.17000/) (2026)

## Abstract (arXiv)

We study the computational complexity of the problem of computing local min-max equilibria of games with a nonconvex-nonconcave utility function f. From the work of Daskalakis, Skoulakis, and Zampetakis [DSZ21], this problem was known to be hard in the restrictive case in which players are required to play strategies that are jointly constrained, leaving open the question of its complexity under more natural constraints. In this paper, we settle the question and show that the problem is PPAD-hard even under product constraints and, in particular, over the hypercube.