Abstract
A convex feasibility problem (CFP) is to find a point x* with the property x* is an element of boolean AND(m)(i=1) C-i, where m >= 1 is an integer ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
