Improved Filter-SQP Algorithm with Active Set for Constrained Minimax Problems
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 s...
Saved in:
Main Authors: | Zhijun Luo, Lirong Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/293475 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A QP-Free Algorithm for Finite Minimax Problems
by: Daolan Han, et al.
Published: (2014-01-01) -
The Hierarchical Minimax Inequalities for Set-Valued Mappings
by: Yen-Cherng Lin, et al.
Published: (2014-01-01) -
Improved Whale Optimization Algorithm for Solving Constrained Optimization Problems
by: Gui-Ying Ning, et al.
Published: (2021-01-01) -
A Generalized Gradient Projection Filter Algorithm for Inequality Constrained Optimization
by: Wei Wang, et al.
Published: (2013-01-01) -
Bilinear Minimax Optimal Control Problems for a von Kárman System with Long Memory
by: Jin-soo Hwang
Published: (2020-01-01)