A modified superlinearly convergent SQP algorithm for minimax problems with inequality constraints

摘要

In this paper, a new improved SQP algorithm which can avoid Maratos effect is proposed to solve minimax problems with inequality constraints. Compared with the existing methods, the computational effort is reduced. In addition, its global and superlinear convergence are obtained under some mild assumptions. Finally, some numerical results show that the method is feasible and effective.