Solutions of Two-stage Stochastic Minimax Problems
Abstract
This paper introduces a class of two-stage stochastic minimax problems where the first-stage objective function is nonconvex-concave while the second-stage objective function is strongly convex-concave. We establish properties of the second-stage minimax value function and solution functions, and characterize the existence and relationships among saddle points, minimax points, and KKT points. We apply the sample average approximation (SAA) to the class of two-stage stochastic minimax problems and prove the convergence of the KKT points as the sample size tends to infinity. An inexact parallel proximal gradient descent ascent algorithm is proposed to solve this class of problems with the SAA. Numerical experiments demonstrate the effectiveness of the proposed algorithm and validate the convergence properties of the SAA approach.
Cite
@article{arxiv.2511.03339,
title = {Solutions of Two-stage Stochastic Minimax Problems},
author = {Hailin Sun and Xiaojun Chen},
journal= {arXiv preprint arXiv:2511.03339},
year = {2025}
}