A Simple SQP Algorithm for Constrained Finite Minimax Problems

Abstract EN

A simple sequential quadratic programming method is proposed to solve the constrained minimax problem.

At each iteration, through introducingan auxiliary variable, the descent direction is given by solving only one quadratic programming.

By solving a corresponding quadratic programming, a high-order revised direction is obtained, which can avoid the Maratos effect.

Furthermore, under some mild conditions, the global and superlinear convergence of the algorithm is achieved.

Finally, some numerical results reported show that the algorithm in this paper is successful.