您要查找的是不是：
- Third, we introduce an analytical placement approach as a convex quadratic program formulation of the power minimization problem. 第三，我们介绍一种分析式摆放演算法，将电能减少问题设成二次方程的公式。
- degenerate convex quadratic program 退化凸二次规划
- convex quadratic program witn box constrains 框式约束凸二次规划
- A CONVEX QUADRATIC PROGRAMMING MODEL OF OPTIMAL GNP 关于国民生产总值最优的凸二次规划模型
- Convex quadratic programming problem 凸二次规划
- convex quadratic programming with box constrains 框式凸二次规划
- convex quadratic programs with box constrains 框式约束凸二次规划
- A Dual Method for Solving a Class of Convex Quadratic Programs 一类凸二次规划的对偶方法
- PREDICTOR-CORRECTOR SMOOTHING METHODS FOR CONVEX QUADRATIC PROGRAMS 凸二次规划的预估校正光滑算法
- The model was transformed to a convexity quadratic programming problem by decomposing index function.Then, the model was resolved using Newton iterative means by importing castigatory gene. 通过分解代价函数，将模型转换为凸二次规划问题，并引入惩罚因子，利用牛顿迭代法求解该模型。
- Non - convex quadratic program 非凸二次规划
- convex quadratic program 凸二次规划
- A Controllable Scheduling Problem with Discrete Processing Times Using Convex Quadratic Programming Relaxation 凸二次规划松弛方法研究离散加工时间可控排序问题
- An Improved Lemke Algorithm for Convex Quadratic Programming With Equality Constraints 一种改进的求解含等式约束凸二次规划问题的Lemke算法
- An Infeasible-Interior-Point Algorithms for Separable Convex Quadratic Programming 可分凸二次规划的不可行内点算法
- A NEW BRANCH-AND-BOUND ALGORITHM FOR SOLVING LARGE COMPLEX INTEGER CONVEX QUADRATIC PROGRAMS 求解中大规模复杂凸二次整数规划问题的新型分枝定界算法
- AN INTERIOR POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING PROBLEM WITH BOX CONSTRAINTS 框式约束凸二次规划问题的内点算法
- A Primal-dual Infeasible Interior Point Algorithm for Convex Quadratic Programming Problem with Box Constraints 框式凸二次规划的原始-对偶不可行内点算法
- A Primal-dual Infeasible Interior Point Algorithm for Separable Convex Quadratic Programming with Box Constraints 框式可分凸二次规划的不可行内点算法
- A Primal-dual Interior Point Algorithm for Convex Quadratic Programming Problem with Linear Constraints 线性约束凸二次规划的一个原始-对偶内点算法
