A Simple SQP Algorithm for Constrained Finite Minimax Problems
Keyword(s):
A simple sequential quadratic programming method is proposed to solve the constrained minimax problem. At each iteration, through introducing an 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.
2010 ◽
Vol 362
(1)
◽
pp. 34-45
◽
2010 ◽
Vol 23
(3)
◽
pp. 787-795
◽
2014 ◽
Vol 580-583
◽
pp. 1961-1965
◽
2014 ◽
Vol 124
◽
pp. 1-6
◽
2005 ◽
Vol 53
(8)
◽
pp. 2680-2687
◽
2007 ◽
Vol 7
(1)
◽
pp. 50-55
◽
1997 ◽
Vol 45
(11)
◽
pp. 1689-1692
◽
2013 ◽
Vol 160
(1)
◽
pp. 158-188
◽