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