Show simple item record

Computing the resolvent of composite operators

dc.creatorMoudafi, Abdellatif
dc.date2014-10-01
dc.identifierhttps://revistas.ufro.cl/ojs/index.php/cubo/article/view/1186
dc.identifier10.4067/S0719-06462014000300007
dc.descriptionBased in a very recent paper by Micchelli et al. [8], we present an algorithmic approach for computing the resolvent of composite operators: the composition of a monotone operator and a continuous linear mapping. The proposed algorithm can be used, for example, for solving problems arising in image processing and traffic equilibrium. Fur- thermore, our algorithm gives an alternative to Dykstra-like method for evaluating the resolvent of the sum of two maximal monotone operators.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad de La Frontera. Temuco, Chile.en-US
dc.relationhttps://revistas.ufro.cl/ojs/index.php/cubo/article/view/1186/1044
dc.sourceCUBO, A Mathematical Journal; Vol. 16 No. 3 (2014): CUBO, A Mathematical Journal; 87-96en-US
dc.sourceCUBO, A Mathematical Journal; Vol. 16 Núm. 3 (2014): CUBO, A Mathematical Journal; 87-96es-ES
dc.source0719-0646
dc.source0716-7776
dc.subjectmaximal monotone operatorsen-US
dc.subjectKM-algorithmen-US
dc.subjectYosida regularizationen-US
dc.subjectDouglas-Rachford algorithmen-US
dc.subjectDykstra-like methoden-US
dc.titleComputing the resolvent of composite operatorsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record