1) nonconvex QCQP with a single quadratic constraint
单二次约束非凸二次规划问题
2) the equality constrained quadratic programming problem
等式约束二次规划问题
1.
In this paper,we give iterative methods for solving the equality constrained quadratic programming problem.
给出了等式约束二次规划问题和等式约束加权最小二乘问题的迭代解
3) convex constrained quadratic programming
凸约束二次规划
1.
Application of the canonical dual transformation theory to a convex constrained quadratic programming;
凸约束二次规划问题求解的一般方法
4) Convex Quadratic Programming
凸二次规划问题
1.
A Differential Equation Approach Based on the Space Transformation of Square Function to Convex Quadratic Programming;
基于平方函数空间变换的凸二次规划问题的微分方程方法
2.
The model is converted into a convex quadratic programming problem,which can not only ensure the existence and the uniqueness of the solution but also make the proposed model applicable for the study of the bidding strategy in a large scale transmission right market.
将该模型的计算转化为求解一个凸二次规划问题,不仅保证了解的唯一性和存在性,还使得该方法能够用于大规模混合输电权市场中的竞价策略分析。
5) unconstrained binary quadratic programming problem
无约束二进制二次规划问题
6) convex quadratic programs with box constrains
框式约束凸二次规划
1.
In this paper,we study a smoothing-type method for the solution of convex quadratic programs with box constrains,to which a variant of Newton′s method is applied.
研究了框式约束凸二次规划的一种光滑算法,算法中应用了牛顿法及其变形形式,证明了算法的全局收敛性。
补充资料：等式约束
分子式：
CAS号：
性质：对优化问题中目标函数自变量的取值用等式加以限制的约束。例如优化问题minf(x),x∈En,Ax=M，Bx>N，Ax=M即是等式约束。
CAS号：
性质：对优化问题中目标函数自变量的取值用等式加以限制的约束。例如优化问题minf(x),x∈En,Ax=M，Bx>N，Ax=M即是等式约束。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条