A splitting method for finding the resolvent of the sum of two maximal monotone operators

DOI10.1080/02331934.2020.1839068MaRDI QIDQ5090286zbMATH OpenOpenAlexFDO

Authors

Publication date 18 July 2022

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2020.1839068

zbMATH Keywords

Hilbert spacefixed pointresolventsplitting methodnonexpansivemaximal monotone

Mathematics Subject Classification ID

Convex programming (90C25) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25)

Cites work

• scientific article; zbMATH DE number 5564093 (Why is no real title available?)
• scientific article; zbMATH DE number 3973706 (Why is no real title available?)
• scientific article; zbMATH DE number 3615396 (Why is no real title available?)
• scientific article; zbMATH DE number 3108780 (Why is no real title available?)
• A dual condition for the convex subdifferential sum formula with applications
• A generalized proximal point algorithm and its convergence rate
• A new projection method for finding the closest point in the intersection of convex sets
• A simple closure condition for the normal cone intersection formula
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• Alternating projection methods.
• An Algorithm for Restricted Least Squares Regression
• Best approximation in inner product spaces
• Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
• Convex analysis and monotone operator theory in Hilbert spaces
• Decomposition through formalization in a product space
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Dualization of signal recovery problems
• Dykstra's alternating projection algorithm for two sets
• Iterative construction of the resolvent of a sum of maximal monotone operators
• Mean Value Methods in Iteration
• Monotone Operators and the Proximal Point Algorithm
• Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
• Nonlinear functional analysis. Fixed point theory and its applications
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the Maximality of Sums of Nonlinear Monotone Operators
• On the convergence rate of Douglas-Rachford operator splitting method
• On the convergence rate of the Krasnosel'skiĭ-Mann iteration
• On the maximal monotonicity of subdifferential mappings
• On weak convergence of the Douglas-Rachford method
• Peaceman-Rachford splitting for a class of nonconvex optimization problems
• Proximal splitting methods in signal processing
• Regularization and Variable Selection Via the Elastic Net
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case

Cited in

(3)

• Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
• Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm
• A Note on the Paper by Eckstein and Svaiter on “General Projective Splitting Methods for Sums of Maximal Monotone Operators”

This page was built for publication: A splitting method for finding the resolvent of the sum of two maximal monotone operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090286)