Abstract: In this paper, a filiter algorithm is proposed to solve Minimax problems with inequality constrains.  Based on the sequential quadratic programming method, the penalty function is not  required by filter strategy. Under some suitable conditions, the global convergence and superlinear  convergence are obtained. Some numerical results show that the method in this paper is effective.