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:45Z</responseDate>
<request identifier=oai:HAL:hal-00779986v1 verb=GetRecord metadataPrefix=oai_dc>http://api.archives-ouvertes.fr/oai/hal/</request>
<GetRecord>
<record>
<header>
<identifier>oai:HAL:hal-00779986v1</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:TDS-MACS</setSpec>
</header>
<metadata><dc>
<publisher>HAL CCSD</publisher>
<title lang=en>On the difference on two maximal monotone operators: Regularization and algorithmic approaches</title>
<creator>Moudafi, Abdellatif</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: 0096-3003</source>
<source>Applied Mathematics and Computation</source>
<publisher>Elsevier</publisher>
<identifier>hal-00779986</identifier>
<identifier>https://hal.univ-antilles.fr/hal-00779986</identifier>
<source>https://hal.univ-antilles.fr/hal-00779986</source>
<source>Applied Mathematics and Computation, Elsevier, 2008, 202 (2), pp.446-452. 〈10.1016/j.amc.2008.01.024〉</source>
<identifier>DOI : 10.1016/j.amc.2008.01.024</identifier>
<relation>info:eu-repo/semantics/altIdentifier/doi/10.1016/j.amc.2008.01.024</relation>
<language>en</language>
<subject lang=en>Maximal monotone operators</subject>
<subject lang=en>Splitting proximal algorithms</subject>
<subject lang=en>Regularization</subject>
<subject lang=en>Duality</subject>
<subject lang=en>DC programming</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>Relying on the Yosida approximate, we investigate the problem of finding zeroes for a difference of two maximal monotone operators in Hilbert spaces. These zeroes are compared to those of the corresponding regularized and dual problems. The behavior of the regularized operator is also studied and a splitting algorithm involving the resolvents of both operators is suggested via a fixed-point formulation of the regularized problem. A particular attention is given to the DC programming case.</description>
<date>2008-08-15</date>
</dc>
</metadata>
</record>
</GetRecord>
</OAI-PMH>