Pages that link to "Item:Q2228367"
From MaRDI portal
The following pages link to Generalized Peaceman-Rachford splitting method with substitution for convex programming (Q2228367):
Displaying 8 items.
- 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)
- Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs (Q5017510) (← 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)
- Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization (Q6151000) (← links)
- Accelerated stochastic Peaceman-Rachford method for empirical risk minimization (Q6151004) (← links)