Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems

摘要

In this paper, the minimax problems with inequality constraints are discussed, and an alternative fast convergent method for the discussed problems is proposed. Compared with the previous work, the proposed method has the following main characteristics. First, the active set identification which can reduce the scale and the computational cost is adopted to construct the direction finding subproblems. Second, the master direction and high-order correction direction are computed by solving a new type of norm-relaxed quadratic programming subproblem and a system of linear equations, respectively. Third, the step size is yielded by a new line search which combines the method of strongly sub-feasible direction with the penalty method. Fourth, under mild assumptions without any strict complementarity, both the global convergence and rate of superlinear convergence can be obtained. Finally, some numerical results are reported.