Pages that link to "Item:Q2664392"
From MaRDI portal
The following pages link to Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming (Q2664392):
Displaying 12 items.
- Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing (Q295499) (← links)
- Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming (Q1787117) (← links)
- An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications (Q2087522) (← 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)
- An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming (Q2326924) (← links)
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA (Q2363673) (← links)
- A proximal Peaceman-Rachford splitting method for compressive sensing (Q2634343) (← links)
- Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming (Q5239082) (← links)
- Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications (Q6049292) (← links)
- Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems (Q6099473) (← links)
- A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems (Q6184273) (← links)
