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...
Guardado en:
Autor principal: | Moudafi,Abdellatif |
---|---|
Lenguaje: | English |
Publicado: |
Universidad de La Frontera. Departamento de Matemática y Estadística.
2014
|
Materias: | |
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!
|
Ejemplares similares
-
Linear Convergence Analysis for General Proximal Point Algorithms Involving (H,η)- Monotonicity Frameworks
por: Verma,Ram U
Publicado: (2011) -
Weak Convergence Theorems for Maximal Monotone Operators with Nonspreading mappings in a Hilbert space
por: Manaka,Hiroko, et al.
Publicado: (2011) -
New interpretation of elliptic Boundary value problems via invariant embedding approach and Yosida regularization
por: Bouarroudj,Nadra, et al.
Publicado: (2018) -
Evolutionary method of construction of solutions of polynomials and related generalized dynamics
por: Yamaleev,Robert M
Publicado: (2011) -
PARALLEL SYNCRHRONOUS ALGORITHM FOR NONLINEAR FIXED POINT PROBLEMS
por: ADDOU,AHMED, et al.
Publicado: (2004)