Perturbed SQP method with active set technology for unconstrained minimax problems

In this paper,the unconstrained minimax problems are discussed.By combining active set identification technique with perturbed sequential quadratic programming(SQP) method,a numerical method is proposed for the problems.Under quite weak conditions,the proposed algorithm possesses weak global convergence.Some preliminary numerical experiments are carried out.