Successive search methods for solving a canonical dc programming problem
Successive search methods for solving a canonical dc programming problem
复制标题
求解典型直流规划问题的连续搜索方法
DOI：
10.1080/02331934.2011.651471
复制
发表时间：
2013
期刊：
影响因子：
2.2
通讯作者：
山田修司，田中環，谷野哲三
中科院分区：
文献类型：
--
作者：
山田修司;田中環;谷野哲三;山田修司，田中環，谷野哲三
在维数大于或等于3的情况下，本文提出了两种连续搜索方法来求解两个紧凸集之间的差集约束下的典型DC规划问题.为了找到可行解，算法基于一个分支和界限过程，依次产生的方向。两种算法都是通过探索两个紧凸集边界相交处的临时解来计算近似解。
In this article, we propose two successive search methods for solving a canonical DC programming problem constrained by the difference set between two compact convex sets in the case where the dimension number is greater than or equal to three. In order to find feasible solutions, the algorithms generate the directions based on a branch and bound procedure, successively. By exploring the provisional solutions throughout the intersection of the boundaries of two compact convex sets, both algorithms calculate an approximate solution.