1) SQP
逐次二次规划
2) Successive Quadratic Programming(SQP) algorithm
逐次二次规划法
3) sequential quadratic programming method
逐步二次规划法
1.
A new way of data fitting and parameter optimization for complex chemical reaction kinetic model was developed based on the integration of numerical analysis and sequential quadratic programming methods, by which not only the weakness of traditional algorithm failing of direct constraint analysis could be overcome, but also the quicker convergence rate and less fitting error could be obtained.
以数值积分和逐步二次规划法的结合为基础,提出了一种新的对复杂反应动力学模型进行数据拟合和参数优化的方法。
4) sequential quadratic programming
逐步二次规划
1.
In this paper, when evolutionary programming and sequential quadratic programming are applied to the structure optimization of feed-forward neural networks, a learning algorithm is proposed.
用进化规划与逐步二次规划来实现前馈神经网络的结构优化问题 ,并提出了一个相应的学习算法 。
5) Step-by-step compensation
逐次规划
6) reduced successive quadratic programming
既约逐步二次规划
1.
In this paper,we propose a reduced successive quadratic programming algorithm for solving optimization problems with nonlinear equality constraints.
提出一种求解非线性等式约束问题的既约逐步二次规划(RSQP)算法。
补充资料：逐次二次规划
分子式：
CAS号：
性质：又称序列二次规划。求解非线性规划问题的一种算法。其特点是，在根据极值点存在的必要条件求极值点时，用一系列二次规划问题的解去逼近Kuhn-Tucker条件方程的解。
CAS号：
性质：又称序列二次规划。求解非线性规划问题的一种算法。其特点是，在根据极值点存在的必要条件求极值点时，用一系列二次规划问题的解去逼近Kuhn-Tucker条件方程的解。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条