Pages that link to "Item:Q2326924"
From MaRDI portal
The following pages link to An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming (Q2326924):
Displaying 5 items.
- Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming (Q1787117) (← links)
- Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix (Q2067888) (← links)
- Generalized Peaceman-Rachford splitting method with substitution for convex programming (Q2228367) (← links)
- Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization (Q2306407) (← links)
- Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs (Q5017510) (← links)