二维中的二次逼近法。
提出一种基于二次逼近模型的PID增益预测控制，并阐述了该系统的结构、算法和应用特点。
PID gain predictive control based on two approximation model is proposed for the problems of the traditional PID control and predictive control.
混合优化控制算法，给出了求解最优控制器的上逼近算法及其凸二次规划求解方法。
Lower approximation algorithm and its solve of convex quadratic programming are also given in this article.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed. The convergence of the algorithm is discussed.
本文提出的这种方法，它的特点在于：我们不是用牛顿迭代法去直接逼近方程的根，而是用牛顿迭代法去逼近方程的二次因子。
The method presented in this paper is not to approximate directly with Newton iterate the roots of a polynomial but to approximate its second order factors.
本文推导出计算机绘图中的二次B一样条曲线的参数方程，介绍二次B一样条曲线的性质，并给出在逼近曲线时的特殊处理方法。
This paper infers the parametric equation of the quadric B-spline curve, introduces its character, and gives the special method of process when the curve is approximated.
其变量个数类似于三次样条，光滑性与逼近阶都比三次样条降低一次，即类似于二次样条。
Its number of variables is similar to the cubic spline. Its order of smoothness and approximation is one order lower than that of cubic spline. Therefore it is similar to the binary spline.
该类算法的基本思想是通过求解一系列二次函数在信赖域中的极小值点逼近最优化问题的解。
The basic idea of these methods is to approximate the optimization problem by a sequence of quadratic minimization problems subject to some trust region.
该类算法的基本思想是通过求解一系列二次函数在信赖域中的极小值点逼近最优化问题的解。
The basic idea of these methods is to approximate the optimization problem by a sequence of quadratic minimization problems subject to some trust region.
应用推荐