A region decomposition method to solve a positive definite quadratic programming is presented.

给出了一个求解正定二次规划的区域分解方法。

Most existed classification problems can be converted into a positive definite quadratic program.

现有的大多数分类问题都能转化成一个正定二次规划问题的求解。

It is equivalent to the conjugate residual method (CR) in the case of symmetric positive definite.

在处理对称正定问题时，它等价于共轭残量(cr)法。

Results linear complementary problem have unique solution when m is generalized positive definite matrix.

结果得到了当m是广义正定矩阵时，线性互补问题存在唯一解。

It wishes to find a new way for normative research into the concept of generalized positive definite matrix.

希望为广义正定矩阵概念的规范化探出一条新路。