Computing the resolvent of composite operators

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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Moudafi,Abdellatif
Lenguaje:	English
Publicado:	Universidad de La Frontera. Departamento de Matemática y Estadística. 2014
Materias:	maximal monotone operators KM-algorithm Yosida regularization Douglas-Rachford algorithm Dykstra-like method
Acceso en línea:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0719-06462014000300007
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:scielo:S0719-06462014000300007
record_format	dspace
spelling	oai:scielo:S0719-064620140003000072018-10-08Computing the resolvent of composite operatorsMoudafi,Abdellatif maximal monotone operators KM-algorithm Yosida regularization Douglas-Rachford algorithm Dykstra-like method 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. Furthermore, our algorithm gives an alternative to Dykstra-like method for evaluating the resolvent of the sum of two maximal monotone operators.info:eu-repo/semantics/openAccessUniversidad de La Frontera. Departamento de Matemática y Estadística.Cubo (Temuco) v.16 n.3 20142014-01-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0719-06462014000300007en10.4067/S0719-06462014000300007
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	maximal monotone operators KM-algorithm Yosida regularization Douglas-Rachford algorithm Dykstra-like method
spellingShingle	maximal monotone operators KM-algorithm Yosida regularization Douglas-Rachford algorithm Dykstra-like method Moudafi,Abdellatif Computing the resolvent of composite operators
description	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. Furthermore, our algorithm gives an alternative to Dykstra-like method for evaluating the resolvent of the sum of two maximal monotone operators.
author	Moudafi,Abdellatif
author_facet	Moudafi,Abdellatif
author_sort	Moudafi,Abdellatif
title	Computing the resolvent of composite operators
title_short	Computing the resolvent of composite operators
title_full	Computing the resolvent of composite operators
title_fullStr	Computing the resolvent of composite operators
title_full_unstemmed	Computing the resolvent of composite operators
title_sort	computing the resolvent of composite operators
publisher	Universidad de La Frontera. Departamento de Matemática y Estadística.
publishDate	2014
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0719-06462014000300007
work_keys_str_mv	AT moudafiabdellatif computingtheresolventofcompositeoperators
_version_	1714206790773637120

Computing the resolvent of composite operators

Ejemplares similares