A Stochastic Algorithm for Minimax Problems
Abstract
This paper deals with minimax problems in which the "inner" problem of maximization is not concave. A procedure based on the approximation of the inner problem by a stochastic set of elements which can contain only two elements at each iteration is shown to converge with probability 1.