Computing the resolvent of composite operators

Downloads

DOI:

https://doi.org/10.4067/S0719-06462014000300007

Abstract

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

maximal monotone operators , KM-algorithm , Yosida regularization , Douglas-Rachford algorithm , Dykstra-like method
  • Abdellatif Moudafi L.S.I.S, Aix Marseille Université, U.F.R Sciences, Domaine Universitaire de Saint-Jérôme. Avenue Escadrille Normandie-Niemen, 13397 MARSEILLE CEDEX 20,
  • Pages: 87-96
  • Date Published: 2014-10-01
  • Vol. 16 No. 3 (2014): CUBO, A Mathematical Journal

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

Vol. 16 No. 3 (2014): CUBO, A Mathematical Journal

Section

Articles