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:39:01Z</responseDate>
<request identifier=oai:HAL:hal-00728144v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:hal-00728144v1</identifier>
<datestamp>2017-12-21</datestamp>
<setSpec>type:ART</setSpec>
<setSpec>collection:BNRMI</setSpec>
<setSpec>collection:UNIV-AG</setSpec>
</header>
<metadata><dc>
<publisher>HAL CCSD</publisher>
<title lang=en>A Lyusternik-Graves theorem for the proximal point method</title>
<creator>Gaydu, Michaël</creator>
<creator>Aragon Artacho, Francisco J.</creator>
<contributor>Laboratoire de Mathématiques Informatique et Applications (LAMIA) ; Université des Antilles et de la Guyane (UAG)</contributor>
<description>International audience</description>
<source>ISSN: 0926-6003</source>
<source>EISSN: 1573-2894</source>
<source>Computational Optimization and Applications</source>
<publisher>Springer Verlag</publisher>
<identifier>hal-00728144</identifier>
<identifier>https://hal.archives-ouvertes.fr/hal-00728144</identifier>
<source>https://hal.archives-ouvertes.fr/hal-00728144</source>
<source>Computational Optimization and Applications, Springer Verlag, 2012, 52 (3), pp.785-803. 〈10.1007/s10589-011-9439-6〉</source>
<identifier>DOI : 10.1007/s10589-011-9439-6</identifier>
<relation>info:eu-repo/semantics/altIdentifier/doi/10.1007/s10589-011-9439-6</relation>
<language>en</language>
<type>info:eu-repo/semantics/article</type>
<type>Journal articles</type>
<date>2012</date>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>
