Sequential quadratic programming (SQP) method is an efficient method for solving smooth constrained optimization problems because of its fast convergence rate.
由于序列二次规划（SQP）算法具有快速收敛速度，所以它是求解光滑约束优化问题的有效方法之一。
The rate of convergence is nearly quadratic, and is quadratic under some additional conditions.
该迭代算法具有几乎二次的收敛率，在某些条件下达到了二次收敛。
The rate of convergence is nearly quadratic, and is quadratic under some additional conditions.
该迭代算法具有几乎二次的收敛率，在某些条件下达到了二次收敛。
应用推荐