Improved Filter-SQP Algorithm with Active Set for Constrained Minimax Problems
Keyword(s):
An improved filter-SQP algorithm with active set for constrained finite minimax problems is proposed. Firstly, an active constraint subset is obtained by a pivoting operation procedure. Then, a new quadratic programming (QP) subproblem is constructed based on the active constraint subset. The main search directiondkis obtained by solving this (QP) subproblem which is feasible at per iteration point and need not to consider the penalty function by using the filter technique. Under some suitable conditions, the global convergence of our algorithm is established. Finally, some numerical results are reported to show the effectiveness of the proposed algorithm.
Keyword(s):
2014 ◽
Vol 2
(1)
◽
pp. 93-108
◽
2013 ◽
Vol 163
(3)
◽
pp. 859-883
◽
Keyword(s):
2012 ◽
Vol 11
(11)
◽
pp. 1655-1659
◽
2013 ◽
Vol 160
(1)
◽
pp. 158-188
◽
2019 ◽
Vol 15
(2)
◽
pp. 757-774
◽
1982 ◽
Vol 11
(2)
◽
pp. 158-166
◽
Keyword(s):
Keyword(s):