primal solution

primal solution的基本解释

-

原来问题解

与primal solution相关的网络例句 [注：此内容来源于网络，仅供参考]

After a limited number of iterations, we can get the optimal solution of the primal problem.

在经过有限次迭代之后，可以求得原问题的最优解。

With the help of bivariate entropy function, another programming is obtained and It's then proved that the solution of primal problem can be approximately obtained by solving a series of such programming.

这篇文章的求解是基于最大团问题的一个超方体约束下的二次规划模型，首先用二元熵函数作辅助项得到另外一个优化模型。

Relationship between the dual form and primal form of solution based on SVM method in a frameable reproducing kernel Hilbert space is studied.

在基于标架型的再生核希尔伯特空间中，研究了SVM算法下，解的对偶形式和原形式之间的关系，进而将SVM算法与最小二乘法相结合，讨论了支持向量机的半参数估计。

The primal problem is split into two parts: a master problem and several subproblems. With the information communication between these two parts, we can finally get the optimal solution of the primal problem.

利用Kuhn-Tuck条件，我们把原问题分解为一个高级问题和若干个相互独立的低级子问题，通过高级问题和低级子问题之间的信息传递，最终可以得到原问题的最优解。

Then the global optimal solution of the primal programming problem can be obtained by solving the converted D.C.programming problem or concave minimization problem via using the existing algorithms.

再利用已有的关于D.C。规划和凹极小的算法，可以求得原问题的全局最优解。

与primal solution相关的网络解释 [注：此内容来源于网络，仅供参考]

primal solution：原来问题解

primal simplex method 原来单形法 | primal solution 原来问题解 | primal variable 原来变量

primal solution：原始解

"原始单体演算法","primal simplex algorithm" | "原始解","primal solution" | "主储存体","primary storage"