untitled
<OAI-PMH schemaLocation=http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd>
<responseDate>2018-01-15T18:37:00Z</responseDate>
<request identifier=oai:HAL:hal-00776640v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:hal-00776640v1</identifier>
<datestamp>2017-12-21</datestamp>
<setSpec>type:UNDEFINED</setSpec>
<setSpec>subject:math</setSpec>
<setSpec>collection:INSMI</setSpec>
<setSpec>collection:UNIV-AG</setSpec>
<setSpec>collection:BNRMI</setSpec>
<setSpec>collection:CEREGMIA</setSpec>
<setSpec>collection:TDS-MACS</setSpec>
</header>
<metadata><dc>
<publisher>HAL CCSD</publisher>
<title lang=en>Extensions of the CQ Algorithm for the split feasibility and split equality problems (10th draft)</title>
<creator>Byrne, Charles L</creator>
<creator>Moudafi, Abdellatif</creator>
<contributor>Department of Mathematical Sciences ; University of Massachusetts [Amherst] (UMass Amherst)</contributor>
<contributor>Centre de Recherche en Economie, Gestion, Modélisation et Informatique Appliquée (CEREGMIA) ; Université des Antilles et de la Guyane (UAG)</contributor>
<identifier>hal-00776640</identifier>
<identifier>https://hal.univ-antilles.fr/hal-00776640</identifier>
<identifier>https://hal.univ-antilles.fr/hal-00776640/document</identifier>
<identifier>https://hal.univ-antilles.fr/hal-00776640/file/CBAM10.pdf</identifier>
<source>https://hal.univ-antilles.fr/hal-00776640</source>
<source>2012</source>
<language>en</language>
<subject>[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]</subject>
<type>info:eu-repo/semantics/preprint</type>
<type>Preprints, Working Papers, ...</type>
<description lang=en>The 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.</description>
<date>2012-12-16</date>
<rights>info:eu-repo/semantics/OpenAccess</rights>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>
