A parametric embedding for the finite minimax problem

We consider unconstrained finite minimax problems where the objective function is described as a maximum of functions f k ∈C 3 (ℜ n,ℜ). We propose a parametric embedding for the minimax problem and, assuming that the corresponding parametric optimization problem belongs to the generic class of Jongen, Jonker and Twilt, we show that if one applies pathfollowing methods (with jumps) to the embedding in the convex case (in the nonconvex case) one obtains globally convergent algorithms. Furthermore, we prove under usual assumptions on the minimax problem that pathfollowing methods applied to a perturbed parametric embedding of the original minimax problem yield globally convergent algorithms for almost all perturbations. Copyright Springer-Verlag Berlin Heidelberg 1999