On the splitting methods and the proximal point algorithm for maximal monotone operators
From MaRDI portal
Publication:3432028
Recommendations
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A family of projective splitting methods for the sum of two maximal monotone operators
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- Projective splitting methods for sums of maximal monotone operators with applications
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
Cited in
(7)- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- General Projective Splitting Methods for Sums of Maximal Monotone Operators
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- On the equivalence of Peaceman-Rachford splitting method and some typical alternating direction method of multipliers
- 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: On the splitting methods and the proximal point algorithm for maximal monotone operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3432028)
