The complexity of constrained min-max optimization

DOI10.1145/3406325.3451125arXiv2009.09623OpenAlexW3168185438MaRDI QIDQ6065268

Stratis Skoulakis, Constantinos Daskalakis, Manolis Zampetakis

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.09623

zbMATH Keywords

computational complexitymin-max optimizationTFNPPPADblack-box lower bounds

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Two Steps at a Time---Taking GAN Training in Stride with Tseng's Method ⋮ Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm ⋮ Public goods games in directed networks

This page was built for publication: The complexity of constrained min-max optimization