A splitting method for finding the resolvent of the sum of two maximal monotone operators
From MaRDI portal
Publication:5090286
DOI10.1080/02331934.2020.1839068OpenAlexW3097295042MaRDI QIDQ5090286
No author found.
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) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Dualization of signal recovery problems
- A new projection method for finding the closest point in the intersection of convex sets
- On the convergence rate of Douglas-Rachford operator splitting method
- Dykstra's alternating projection algorithm for two sets
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- On the maximal monotonicity of subdifferential mappings
- Proximal Splitting Methods in Signal Processing
- On Weak Convergence of the Douglas–Rachford Method
- An Algorithm for Restricted Least Squares Regression
- Decomposition through formalization in a product space
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- A simple closure condition for the normal cone intersection formula
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- ON THE CONVERGENCE RATE OF THE KRASNOSEL’SKIĬ–MANN ITERATION
- A Generalized Proximal Point Algorithm and Its Convergence Rate
- Regularization and Variable Selection Via the Elastic Net
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- On the Maximality of Sums of Nonlinear Monotone Operators
- Mean Value Methods in Iteration
- Convex analysis and monotone operator theory in Hilbert spaces
- Best approximation in inner product spaces
