Optimization Online


A composition projection method for convex feasibility problems

Chen Jiawei(j.w.chen713***at***163.com)

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


Download: [PDF]

Entry Submitted: 10/17/2015
Entry Accepted: 10/17/2015
Entry Last Modified: 10/17/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society