a3/2-approximation algorithm is presented for a controllable scheduling problem with discrete processing times using convex quadratic programming relaxation.
离散加工时间可控的排序问题,得到界为3/2的多项式时间近似算法。
an infeasible interior point algorithm for convex quadratic programming based on logarithmic transformation;
给出了二次锥规划的一种非精确不可行内点算法。
when used to solve the convex quadratic programming problems with super large scale of training samples(11000 training samples), the algorithm designed in this paper works better.
本文采用的方法在解决大规模训练问题(如11000个训练样本)时表现出的性能令人满意。
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.
它将机器学习问题转化为求解最优化问题,并应用最优化理论构造算法来解决凸二次规划问题。
a new gradient-based neural network for solving convex quadratic programming problems is proposed by means of the inherent properties of the original problem.
kernel nearest neighbor convex hull (knnch) classifier involves solving convex quadratic programming problems, which requires large memory and long computation time for large-scale problem.