A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems

摘要

In this paper, nonlinear minimax problems with inequality constraints are discussed. Combined the norm-relaxed SQP method with the idea of strongly sub-feasible directions method, a new method of quasi-strongly sub-feasible directions (MQSSFD) with arbitrary initial point for the discussed problems is presented. At each iteration of the proposed algorithm, an improved search direction is obtained by solving a quadratic program (QP) which always has a solution, and a high-order correction direction is yielded via a system of linear equations (SLE) to avoid the Maratos effect. After finite iterations, the iteration point always get into the feasible set by introducing a new non-monotone curve search. Under some mild conditions including the weak Mangasarian–Fromovitz constraint qualification (MFCQ), the proposed algorithm possesses global convergence, and the superlinear convergence is obtained without the strict complementarity. Finally, some elementary numerical experiments are implemented and reported.