提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。

We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.

youdao

结果表明，随着海拔的增加，间隔子长度、分株密度、分枝角度和分枝强度呈二次曲线变化。

The results showed that the change patterns of spacer length, ramet density, branching intensity, and branching Angle of Duchesnea indica were in a quadratic curve when the elevation increased.

youdao

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

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