Pages that link to "Item:Q5239082"
From MaRDI portal
The following pages link to Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming (Q5239082):
Displaying 4 items.
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators (Q721953) (← links)
- Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming (Q1787117) (← links)
- Generalized Peaceman-Rachford splitting method with substitution for convex programming (Q2228367) (← links)
- Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs (Q5017510) (← links)