The key idea of SSVM is to transform the standard model of SVM into an unconstraint quadric convex programming problem.
SSVM模型的基本思想是将标准的支撑向量机模型转化成一个无约束二次凸规划模型进行求解。
The paper offers a dual problem for the semi-infinite convex programming by using the directional derivative with zero dual gap.
本文对半无限凸规划提出一个用方向导数表述的对偶问题，其对偶间隙为零。
SVM transforms machine learning to solve an optimization problem, and to solve a convex quadratic programming problem by the optimization theory and method constructing algorithms.
它将机器学习问题转化为求解最优化问题，并应用最优化理论构造算法来解决凸二次规划问题。
In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
The problem of collision detection between a pair of convex objects is summed up a problem of non-linear programming with restrict conditions in this paper.
将两凸物体间碰撞检测问题归结为一个带约束条件的非线性规划问题。
The optimization problem can be solved based on the density-stiffness interpolation scheme and the method of moving asymptotes belonging to sequential convex programming approaches.
采用基于密度刚度插值模型和序列凸规划法中的移动渐近线方法求解优化模型。 通过经典算例验证了本方法的有效性。
The problem about how to determine the weak efficient solution of convex multiobjective programming is turned into a problem judge whether an equation has non-negative non-zero solution.
将弱有效解的判断问题转化为判断一线性方程组是否存在非负、非零解的问题。
One method of solving the problem of sphere-constrained convex quadratic programming;
介绍一种求解高维凸二次规划的可行方向法。
One method of solving the problem of sphere-constrained convex quadratic programming;
介绍一种求解高维凸二次规划的可行方向法。
应用推荐