A partially inexact bundle method for convex semi-infinite minmax problems

We present a bundle method for solving convex semi-infinite minmax problems which allows inexact solution of the inner maximization. The method is of the partially inexact oracle type, and it is aimed at reducing the occurrence of null steps and at improving bundle handling with respect to existing methods.Termination of the algorithm is proved at a point satisfying an approximate optimality criterion, and the results of some numerical experiments are also reported.