Extensions of the CQ Algorithm for the Split Feasibility and Split Equality Problems
AbstractThe convex feasibility problem (CFP) is to find a member of the intersection of finitely many closed convex sets in Euclidean space. When the intersection is empty, one can minimize a proximity function to obtain an approximate solution to the problem. The split feasibility problem (SFP) and the split equality problem (SEP) are generalizations of the CFP. The approximate SFP (ASFP) and approximate SEP (ASEP) involve finding only approximate solutions to the SFP and SEP, respectively. We present here the SSEA, a simultaneous iterative algorithm for solving the ASEP. When this algorithm is applied to the ASFP it resembles closely, but is not equivalent to, the CQ algorithm. The SSEA involves orthogonal projection onto the given closed convex sets. The relaxed SSEA (RSSEA) is an easily implementable variant of the SSEA that uses orthogonal projection onto half-spaces at each step to solve the SEP. The perturbed version of the SSEA (PSSEA) is similar to the RSSEA, but uses orthogonal projection onto a sequence of epi-convergent closed convex sets.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by CEREGMIA, Université des Antilles et de la Guyane in its series Documents de Travail with number 2013-01.
Length: 15 pages
Date of creation: Jan 2013
Date of revision:
Contact details of provider:
Postal: Campus de Schoelcher, B.P. 7209, 97275 Schoelcher Cedex
Web page: http://www.ceregmia.eu/
More information through EDIRC
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statistics
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Janis Hilaricus).
If references are entirely missing, you can add them using this form.