In this paper, they modify the CHIP method and use the modified one to solve a broader class of non-convexprogramming problems.
文中对CHIP方法进行了改进并利用改进的方法去求解更大一类的非凸规划问题。
2
Finally, the relationships between generalized set-valued variational inclusion problems and non-convexprogramming are studied.
最后研究了广义集值变分包含问题与非凸规划之间的关系。
3
In the branch and bound method for solving non-convexprogramming, the choice of region subdivision directly affects the convergence of the whole algorithm.