Pages that link to "Item:Q5268890"
From MaRDI portal
The following pages link to A proximal partially parallel splitting method for separable convex programs (Q5268890):
Displaying 11 items.
- A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming (Q530249) (← links)
- Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming (Q824816) (← links)
- Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit (Q1743377) (← links)
- A parameterized proximal point algorithm for separable convex optimization (Q1800446) (← links)
- A proximal fully parallel splitting method for stable principal component pursuit (Q1993345) (← links)
- An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems (Q2105290) (← links)
- On the convergence rate of the augmented Lagrangian-based parallel splitting method (Q4622886) (← links)
- Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems (Q4632727) (← links)
- A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems (Q5031806) (← links)
- A new alternating projection-based prediction–correction method for structured variational inequalities (Q5379457) (← links)
- A proximal fully parallel splitting method with a relaxation factor for separable convex programming (Q6086848) (← links)
