A relaxed alternating CQ-algorithm for convex feasibility - Université des Antilles Access content directly
Journal Articles Nonlinear Analysis: Theory, Methods and Applications Year : 2013

A relaxed alternating CQ-algorithm for convex feasibility

Abstract

Let H1,H2,H3 be real Hilbert spaces, let C⊂H1, Q⊂H2 be two nonempty closed convex level sets, let A:H1→H3, B:H2→H3 be two bounded linear operators. Our interest is in solving the following new convex feasibility problem Find x∈C,y∈Q such that Ax=By, which allows asymmetric and partial relations between the variables x and y. In this paper, we present and study the convergence of a relaxed alternating CQ-algorithm (RACQA) and show that the sequences generated by such an algorithm weakly converge to a solution of (1.1). The interest of RACQA is that we just need projections onto half-spaces, thus making the relaxed CQ-algorithm implementable. Note that, by taking B=I, in (1.1), we recover the split convex feasibility problem originally introduced in Censor and Elfving (1994) [13] and used later in intensity-modulated radiation therapy (Censor et al. (2006) [11]). We also recover the relaxed CQ-algorithm introduced by Yang (2004) [8] by particularizing both B and a given parameter.

Dates and versions

hal-00776638 , version 1 (15-01-2013)

Identifiers

Cite

Abdellatif Moudafi. A relaxed alternating CQ-algorithm for convex feasibility. Nonlinear Analysis: Theory, Methods and Applications, 2013, 79, pp.117-121. ⟨10.1016/j.na.2012.11.013⟩. ⟨hal-00776638⟩

Collections

UNIV-AG TDS-MACS
159 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More