Pages that link to "Item:Q1787117"
From MaRDI portal
The following pages link to Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming (Q1787117):
Displaying 7 items.
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators (Q721953) (← links)
- Generalized Peaceman-Rachford splitting method with substitution for convex programming (Q2228367) (← links)
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA (Q2363673) (← links)
- Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming (Q2664392) (← links)
- Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem (Q2679568) (← links)
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP (Q5106411) (← links)
- Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming (Q5239082) (← links)