In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.

针对凸约束非凸二次规划问题，给出了一个分枝定界方法。

youdao

In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.

针对凸约束非凸二次规划问题，给出了一个分枝定界方法。

youdao