A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming

Based on the discretization methods for solving semi-infinite programming problems, this paper presents a new nonmonotonic trust region algorithm for a class of semi-infinite minimax programming problem. Under some mild assumptions, the global convergence of the proposed algorithm is given. Numerical tests are reported that show the efficiency of the proposed method.