In this paper we present a class of nondifferentiable optimization problems: seim-infinite minimax problems which arise from engineering design. Two algorithms for solving the problems are constructed by combining the idea of discretion with the method for solving minimax problems, and the convergence of the algorithms is proved under weaker conditions. Numerical tests show that the algorithms are practical and effective.
修改评论