relaxed CQ algorithm 松驰CQ算法
relaxed iterative algorithm 松弛迭代法
Relaxed projection algorithm 松弛投影算法
A projection subgradient algorithm for the Lagrangian dual problem of the relaxed quadratic problem is employed to general lower bounds of the optimal value for the original problem.
采用椭球剖分策略剖分可行域为小的椭球，用投影次梯度算法解松弛二次规划问题的拉格朗日对偶问题，从而获得原问题的一个下界。
The algorithm relaxed the restricted conditions by fuzzing the element of partition matrix in the iterative process.
算法将迭代过程中的分区矩阵“元素化”放宽了限制条件。
应用推荐