Two iterative algorithms for finding minimax solutions

Two iterative minimax algorithms are presented with associated convergence theorems. Both algorithms consist of iterative procedures based on a sequence of finite parameter sets. In general, these finite parameter sets are subsets of an infinite parameter space. To show their applicabilities, several commonly used examples are presented. It is also shown that minimax problems with or without finite parameter sets can be solved by these two algorithms numerically to any assigned degree of accuracy.<
>