A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization |
| |
Authors: | Jin-Bao Jian Qing-Jie Hu Hai-Yan Zheng |
| |
Affiliation: | 1. College of Mathematics and Information Science , Guangxi University , Nanning, China;2. Department of Information , Hunan Business College , Changsha, China |
| |
Abstract: | Combining the ideas of generalized projection and the strongly subfeasible sequential quadratic programming (SQP) method, we present a new strongly subfeasible SQP algorithm for nonlinearly inequality-constrained optimization problems. The algorithm, in which a new unified step-length search of Armijo type is introduced, starting from an arbitrary initial point, produces a feasible point after a finite number of iterations and from then on becomes a feasible descent SQP algorithm. At each iteration, only one quadratic program needs to be solved, and two correctional directions are obtained simply by explicit formulas that contain the same inverse matrix. Furthermore, the global and superlinear convergence results are proved under mild assumptions without strict complementarity conditions. Finally, some preliminary numerical results show that the proposed algorithm is stable and promising. |
| |
Keywords: | Generalized projection Optimization Sequential quadratic programming Strongly subfeasible Superlinear convergence |
|
|