In this paper we present a new algorithm for solving quadratic programming problem (QP) with quadratic constraints.
在本文中,我们提出了一种解带有二次约束二次规划问题(QP)的新算法。
We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
The key problem of training support vector machines is how to solve quadratic programming problem, but for large training examples, the problem is too difficult.
训练支持向量机的本质问题就是求解二次规划问题,但对大规模的训练样本来说,求解二次规划问题困难很大。
The predictive model is derived and the solution of a generalized predictive controller with restrictions is changed into a constrained quadratic programming problem.
推导了带约束的预测模型,并将约束广义预测控制的求解化为典型的约束二次规划。
A mathematic model of road identification problem is provided and the problem is related with a positive definite quadratic programming problem with inequality constraints.
建立了道路识别问题的数学模型并将上述问题与一个不等式约束的正定二次规划问题相联系。
This paper considers the extended quadratic programming problem. Based on the necessary and sufficient conditions for a saddle point, a neural network for solving it is proposed.
考虑了广义二次规划问题,基于其鞍点的充要条件,提出了求解它的一个神经网络。
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.
它将机器学习问题转化为求解最优化问题,并应用最优化理论构造算法来解决凸二次规划问题。
The weight coefficient was introduced into the model, and the multi-objective problem was changed into a quadratic-programming problem.
该模型通过引入权系数,使多目标问题转化为一个二次目标、线性约束的二次规划问题。
The weight coefficient was introduced into the model, and the multi-objective problem was changed into a quadratic-programming problem.
该模型通过引入权系数,使多目标问题转化为一个二次目标、线性约束的二次规划问题。
应用推荐