在此基础上对不同维度的核进行集成，本文引入二次约束二次规划(Quadratically Constrained Quadratic Programming, QCQP)方法来产生2D核和3D核的最优组合。
基于12个网页-相关网页
在本文中，我们提出了一种解带有二次约束二次规划问题(QP)的新算法。
In this paper we present a new algorithm for solving quadratic programming problem (QP) with quadratic constraints.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.
该模型通过引入权系数，使多目标问题转化为一个二次目标、线性约束的二次规划问题。
The weight coefficient was introduced into the model, and the multi-objective problem was changed into a quadratic-programming problem.
应用推荐