A Globally Convergent Line Search Filter SQP Method for Inequality Constrained Optimization
A line search filter SQP method for inequality constrained optimization is presented. This method makes use of a backtracking line search procedure to generate step size and the efficiency of the filter technique to determine step acceptance. At each iteration, the subproblem is always consistent, a...
Main Author: | Zhong Jin |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/524539 |
Similar Items
-
Improved Filter-SQP Algorithm with Active Set for Constrained Minimax Problems
by: Zhijun Luo, et al.
Published: (2014-01-01) -
Convergence rates for the variable, the multiplier, and the pair in SQP methods
by: Chiang, Jershan
Published: (2009) -
A Simple SQP Algorithm for Constrained Finite Minimax Problems
by: Lirong Wang, et al.
Published: (2014-01-01) -
Global Convergence of a New Nonmonotone Filter Method for Equality Constrained Optimization
by: Ke Su, et al.
Published: (2013-01-01) -
A Note on Convergence Analysis of an SQP-Type Method for Nonlinear Semidefinite Programming
by: Zhang Shaowu, et al.
Published: (2008-01-01)