讨论了SQP算法与QP-free算法的研究背景及现状,介绍了它们的具体步骤及其相应的优缺点,构造了一个特殊的仅含等式约束的QP子问题,提出了相应的修正SQP方法,使之仍然具有求解不等式约束二次规划子问题的SQP方法相应的特点。构造一个特殊的线性方程组子问题,提出了相应的修正QP-free方法,减少了每步求解的子问题个数。
Firstly,the research background and the current situation are discussed for the SQP algorithms and the QP-free algorithms.The specific steps and their corresponding advantages and disadvantages of two types of methods are described in detail.Then,against their shortcomings,a special equality constrained QP sub-problems is constructed,and the corresponding modified SQP method is proposed,such that it still has the corresponding features of SQP methods by solving inequality constrained quadratic programming sub-problems.A special sub-problem with linear equations is constructed,and corresponding modified QP-free method is proposed,such that the number of solving sub-problem is reduced in each step.