Pages that link to "Item:Q5350478"
From MaRDI portal
The following pages link to Application of the Strictly Contractive Peaceman-Rachford Splitting Method to Multi-Block Separable Convex Programming (Q5350478):
Displaying 5 items.
- A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming (Q1716951) (← links)
- Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming (Q1787117) (← links)
- A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming (Q2020565) (← links)
- Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond (Q4967329) (← links)
- A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems (Q5031806) (← links)
