最后研究了广义集值变分包含问题与非凸规划之间的关系。
Finally, the relationships between generalized set-valued variational inclusion problems and non-convex programming are studied.
在求解非凸规划的分枝定界法中,剖分区间的选取直接影响到整个算法的收敛速度。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
文中对CHIP方法进行了改进并利用改进的方法去求解更大一类的非凸规划问题。
In this paper, they modify the CHIP method and use the modified one to solve a broader class of non-convex programming problems.
应用推荐