A SQP Method for Inequality Constrained Optimization

2002 ◽  
Vol 18 (1) ◽  
pp. 77-84 ◽  
Author(s):  
Ju-liang Zhang ◽  
Xiang-sun Zhang
2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Zhong Jin

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, and it only needs to solve one QP subproblem. Under some mild conditions, the global convergence property can be guaranteed. In the end, numerical experiments show that the method in this paper is effective.


2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Zhijun Luo ◽  
Lirong Wang

A new parallel variable distribution algorithm based on interior point SSLE algorithm is proposed for solving inequality constrained optimization problems under the condition that the constraints are block-separable by the technology of sequential system of linear equation. Each iteration of this algorithm only needs to solve three systems of linear equations with the same coefficient matrix to obtain the descent direction. Furthermore, under certain conditions, the global convergence is achieved.


Sign in / Sign up

Export Citation Format

Share Document