论文信息 - An improved SQP algorithm for solving minimax problems

An improved SQP algorithm for solving minimax problems

In this work, an improved SQP method is proposed for solving minimax problems, and a new method with small computational cost is proposed to avoid the Maratos effect. In addition, its global and superlinear convergence are obtained under some suitable conditions.

[1] A. Tits,et al. Nonmonotone line search for minimax problems , 1993 .

[2] S. Lucidi,et al. Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems , 1995 .

[3] D. Mayne,et al. Superlinearly convergent algorithm for min-max problems , 1991 .

[4] I. Husain,et al. Continuous-time fractional minmax programming , 2005, Math. Comput. Model..

[5] S. P. Han,et al. Variable metric methods for minimizing a class of nondifferentiable functions , 1977, Math. Program..

[6] A. Vardi,et al. New minimax algorithm , 1984 .