科研之友
微信
新浪微博
Facebook
分享链接
摘要
An iterative algorithm is proposed for minimizing a convex function on a set defined as the set-theoretic difference between a convex set and the union of several convex sets. The convergence of the algorithm is proved in terms of necessary conditions for a local minimum.
