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

2013 ◽  
Vol 163 (3) ◽  
pp. 859-883 ◽  
Author(s):  
Jin-bao Jian ◽  
Qing-juan Hu ◽  
Chun-ming Tang
Keyword(s):  
Line Search ◽  
Minimax Problems ◽  
Active Set ◽  
Sqp Method ◽  
Constrained Minimax Problems ◽  
Constrained Minimax ◽  
Set Identification

scholarly journals Improved Filter-SQP Algorithm with Active Set for Constrained Minimax Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Zhijun Luo ◽  
Lirong Wang
Keyword(s):  
Global Convergence ◽  
Penalty Function ◽  
Minimax Problems ◽  
Active Set ◽  
Active Constraint ◽  
Sqp Algorithm ◽  
Operation Procedure ◽  
Finite Minimax ◽  
Constrained Minimax Problems ◽  
Constrained Minimax

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.

scholarly journals A proximal-projection partial bundle method for convex constrained minimax problems

2019 ◽  
Vol 15 (2) ◽  
pp. 757-774 ◽  
Author(s):  
Chunming Tang ◽  
◽  
Jinbao Jian ◽  
Guoyin Li ◽  
◽  
...  
Keyword(s):  
Minimax Problems ◽  
Bundle Method ◽  
Constrained Minimax Problems ◽  
Constrained Minimax
Sign in / Sign up

Export Citation Format

Share Document