A composition projection method for convex feasibility problems
Abstract: In this article, we propose a composition projection algorithm for solving feasibility problem in Hilbert space. The convergence of the proposed algorithm are established by using gap vector which does not involve the nonempty intersection assumption. Moreover, we provide the sufficient and necessary condition for the convergence of the proposed method.
Keywords: Feasibility problem; Gap vector; Projection.
Category 1: Convex and Nonsmooth Optimization
Entry Submitted: 10/17/2015
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|