Global convergence on an active set SQP for inequality constrained optimization |
| |
Institution: | 1. Department of Applied Mathematics, Mathematics, Hebei University of Technology, Tianjin, China;2. Singapore-MIT Alliance, National University of Singapore, E4-04-10, 4 Engineering Drive 3, Singapore 117576, Singapore |
| |
Abstract: | Sequential quadratic programming (SQP) has been one of the most important methods for solving nonlinearly constrained optimization problems. In this paper, we present and study an active set SQP algorithm for inequality constrained optimization. The active set technique is introduced which results in the size reduction of quadratic programming (QP) subproblems. The algorithm is proved to be globally convergent. Thus, the results show that the global convergence of SQP is still guaranteed by deleting some “redundant” constraints. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|