In this paper, they modify the CHIP method and use the modified one to solve a broader class of non-convex programming problems.
文中对CHIP方法进行了改进并利用改进的方法去求解更大一类的非凸规划问题。
Finally, the relationships between generalized set-valued variational inclusion problems and non-convex programming are studied.
最后研究了广义集值变分包含问题与非凸规划之间的关系。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题,给出了一个分枝定界方法。
应用推荐