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:49Z</responseDate>
<request identifier=oai:HAL:hal-00779255v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:hal-00779255v1</identifier>
<datestamp>2017-12-21</datestamp>
<setSpec>type:ART</setSpec>
<setSpec>subject:math</setSpec>
<setSpec>collection:INSMI</setSpec>
<setSpec>collection:UNIV-AG</setSpec>
<setSpec>collection:BNRMI</setSpec>
<setSpec>collection:TDS-MACS</setSpec>
</header>
<metadata><dc>
<publisher>HAL CCSD</publisher>
<title lang=en>Approximate inertial proximal methods using the enlargement of maximal monotone operators</title>
<creator>Moudafi, Abdellatif</creator>
<creator>Elizabeth, E.</creator>
<contributor>Groupe de Recherche en Informatique et Mathématiques Appliquées Antilles-Guyane (GRIMAAG) ; Université des Antilles et de la Guyane (UAG)</contributor>
<description>International audience</description>
<source>ISSN: 1311-8080</source>
<source>EISSN: 1314-3395</source>
<source>International Journal of Pure and Applied Mathematics</source>
<publisher>Academic Publishing Ltd</publisher>
<identifier>hal-00779255</identifier>
<identifier>https://hal.univ-antilles.fr/hal-00779255</identifier>
<identifier>https://hal.univ-antilles.fr/hal-00779255/document</identifier>
<identifier>https://hal.univ-antilles.fr/hal-00779255/file/10.1.1.13.4261_3_.pdf</identifier>
<source>https://hal.univ-antilles.fr/hal-00779255</source>
<source>International Journal of Pure and Applied Mathematics, Academic Publishing Ltd, 2003, 5 (3), pp.283-299</source>
<language>en</language>
<subject lang=it>Monotone operators</subject>
<subject lang=it>elargements</subject>
<subject lang=it>proximal point algorithm</subject>
<subject lang=it>local lipschitz</subject>
<subject lang=it>approximate subdifferential</subject>
<subject lang=it>convergence</subject>
<subject lang=it>convex minimization</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>An approximate procedure for solving the problem of nding a zero of a maximal monotone operator is proposed and its convergence is established under various conditions. More precisely, it is shown that this method weakly converges under natural assumptions and strongly converges provided that either the inverse of the involved operator is Lipschitz continuous around zero or the interior of the solution set is nonempty. A particular attention is given to the convex minimization case. AMS Subject Classication : Primary, 90C ; Secondary, 49M45, 65C.</description>
<date>2003</date>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>
