Computing the resolvent of composite operators
-
Abdellatif Moudafi
abdellatif.moudafi@lsis.org
Downloads
DOI:
https://doi.org/10.4067/S0719-06462014000300007Abstract
Based 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.
Keywords
Similar Articles
- Abdelhamid Bensalem, Abdelkrim Salim, Bashir Ahmad, Mouffak Benchohra, Existence and controllability of integrodifferential equations with non-instantaneous impulses in Fréchet spaces , CUBO, A Mathematical Journal: Vol. 25 No. 2 (2023)
- Abdoul Aziz Kalifa Dianda, Khalil Ezzinbi, Almost automorphic solutions for some nonautonomous evolution equations under the light of integrable dichotomy , CUBO, A Mathematical Journal: Vol. 27 No. 1 (2025)
- Rubí E. Rodríguez, Anita M. Rojas, Matías Saavedra-Lagos, Representaciones lineales irreducibles de grupos finitos en cuerpos de números , CUBO, A Mathematical Journal: Vol. 27 No. 2 (2025): Spanish Edition (40th Anniversary)
You may also start an advanced similarity search for this article.
Downloads
Download data is not yet available.
Published
2014-10-01
How to Cite
[1]
A. Moudafi, “Computing the resolvent of composite operators”, CUBO, vol. 16, no. 3, pp. 87–96, Oct. 2014.
Issue
Section
Articles
