The quadratic programming problem is obtained when the functional is discretized by the finite strip method.
借助有限条法在矩形域上离散这个泛函，得到了一个特殊的二次泛函的规化问题。
In this paper we present a new algorithm for solving quadratic programming problem (QP) with quadratic constraints.
在本文中，我们提出了一种解带有二次约束二次规划问题(QP)的新算法。
We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
应用推荐