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:36:46Z</responseDate>
<request identifier=oai:HAL:hal-00779984v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:hal-00779984v1</identifier>
<datestamp>2017-12-21</datestamp>
<setSpec>type:ART</setSpec>
<setSpec>subject:math</setSpec>
<setSpec>collection:INSMI</setSpec>
<setSpec>collection:BNRMI</setSpec>
<setSpec>collection:UNIV-AG</setSpec>
<setSpec>collection:CEREGMIA</setSpec>
<setSpec>collection:TDS-MACS</setSpec>
</header>
<metadata><dc>
<publisher>HAL CCSD</publisher>
<title lang=en>A Variable Krasnoselski-Mann Algorithm for a New Class of Fixed Point Problems</title>
<creator>Moudafi, Abdellatif</creator>
<contributor>Centre de Recherche en Economie, Gestion, Modélisation et Informatique Appliquée (CEREGMIA) ; Université des Antilles et de la Guyane (UAG)</contributor>
<description>International audience</description>
<source>ISSN: 0163-0563</source>
<source>EISSN: 1532-2467</source>
<source>Numerical Functional Analysis and Optimization</source>
<publisher>Taylor & Francis</publisher>
<identifier>hal-00779984</identifier>
<identifier>https://hal.univ-antilles.fr/hal-00779984</identifier>
<source>https://hal.univ-antilles.fr/hal-00779984</source>
<source>Numerical Functional Analysis and Optimization, Taylor & Francis, 2009, 30 (5-6), pp.582-590. 〈10.1080/01630560902987436〉</source>
<identifier>DOI : 10.1080/01630560902987436</identifier>
<relation>info:eu-repo/semantics/altIdentifier/doi/10.1080/01630560902987436</relation>
<language>en</language>
<subject lang=en>Firmly nonexpansive mapping</subject>
<subject lang=en>Fixed point</subject>
<subject lang=en>K-M algorithm</subject>
<subject lang=en>Partial inverse</subject>
<subject>[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]</subject>
<type>info:eu-repo/semantics/article</type>
<type>Journal articles</type>
<description lang=en>We study the convergence of a variable version of the Krasnoselski-Mann algorithm applied to a primal dual fixed point problem. The link with Spingarn's partial inverse method is made, and an application to feasibility problems and mathematical programming is also proposed.</description>
<date>2009-06-30</date>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>
