解凸可行性问题的选择性投影方法

Selective projection method for convex feasibility problem solving

提出了一种新的更简捷的求解凸可行问题的计算方法——选择性投影方法。由于该方法每一步迭代中只计算一次投影算子,因此该方法具有计算工作量小的优越性,同时也证明了该算法的强收敛性。

A new and simpler algorithm for solving convex feasibility problems named selective projection method is proposed.This method has the advantage of small computational effort since it only computes the projection operator once in each iteration.Meanwhile,the strong convergence of the algorithm is proved.