Computing the resolvent of composite operators

DOI10.4067/S0719-06462014000300007zbMath1357.47073OpenAlexW2027901088MaRDI QIDQ3450630

Abdellatif Moudafi

Publication date: 6 November 2015

Published in: Cubo (Temuco) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4067/s0719-06462014000300007

zbMATH Keywords

maximal monotone operatorsDouglas-Rachford algorithmYosida regularizationDykstra-like methodKM-algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Set-valued and variational analysis (49J53) Iterative procedures involving nonlinear operators (47J25) Numerical methods based on nonlinear programming (49M37)

Related Items (5)

Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application ⋮ On a new simple algorithm to compute the resolvents ⋮ Resolvent of the parallel composition and the proximity operator of the infimal postcomposition ⋮ Strengthened splitting methods for computing resolvents ⋮ Iterative methods for computing the resolvent of the sum of a maximal monotone operator and composite operator with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Split monotone variational inclusions
• The asymptotic behavior of the composition of two resolvents
• Composition duality and maximal monotonicity
• Finding a zero of the sum of two maximal monotone operators
• The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
• Proximity algorithms for the L1/TV image denoising model
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Quantitative stability analysis for maximal monotone operators and semi-groups of contractions
• Dualization of Generalized Equations of Maximal Monotone Type

This page was built for publication: Computing the resolvent of composite operators