针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
基于最优d . C。分解的单二次约束非凸二次规划精确算法。
An Optimal D. C. Decomposition Algorithm for Quadratic Program with a Single Quadratic Constraint.
基于最优d . C。分解的单二次约束非凸二次规划精确算法。
An Optimal D. C. Decomposition Algorithm for Quadratic Program with a Single Quadratic Constraint.
应用推荐