凸二次规划 [数] convex quadratic programming ; convex quadratic optimization
非凸二次规划 non-convex quadratic programming
凸二次规划问题 [数] convex quadratic programming problem
严格凸二次规划 Strict Convex Quadratic Program
性约束的凸二次规划 Quadratic Programming ; QP
整凸二次规划 integer convex quadratic programming
可分凸二次规划 Separable convex quadratic programming
球约束凸二次规划 Ball constrained convex quadratic programming
框式凸二次规划问题 Convex quadratic programming problem with box constraints
SSVM模型的基本思想是将标准的支撑向量机模型转化成一个无约束二次凸规划模型进行求解。
The key idea of SSVM is to transform the standard model of SVM into an unconstraint quadric convex programming problem.
大量的关于随机的凸二次规划问题的数值实验结果表明它的计算效率是高的，在某些条件下可能是多项式时间算法。
Some numerical results for a large number of random convex quadratic programming problems show that the new algorithm is efficient and might be a polynomial-time algorithm under some conditions.
它将机器学习问题转化为求解最优化问题，并应用最优化理论构造算法来解决凸二次规划问题。
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.
应用推荐