A cutting plane method for solving minimax problems in the complex plane

It is shown how the combined discretization and cutting plane method for general convex semi-infinite programming problems recently presented in 40] can be effectively implemented for the solution of minimax problems in the complex plane. In contrast to other approaches, the minimax problem does not have to be linearized. The performance of the algorithm is demonstrated by a number of highly accurate numerical examples.