Minimax problems are
considered whose admissable sets are given implicitly as the solution sets of
another minimax problem. For the solution a parametric method is proposed.
Special cases of it are extensions of Courant’s exterior penalty method and
Tihonov’s regularization method of Nonlinear Programming to minimax
problems.
In solving quadratic problems explicitly, a representation of modified best
approximate solutions of linear equations in Hilbert spaces is given that extends
results for the usual case.