Pages that link to "Item:Q2348955"
From MaRDI portal
The following pages link to A proximal parallel splitting method for minimizing sum of convex functions with linear constraints (Q2348955):
Displayed 10 items.
- A new alternating direction method for linearly constrained nonconvex optimization problems (Q496618) (← links)
- A note on augmented Lagrangian-based parallel splitting method (Q497450) (← links)
- Linearized block-wise alternating direction method of multipliers for multiple-block convex programming (Q1716995) (← links)
- A proximal block minimization method of multipliers with a substitution procedure (Q3458819) (← links)
- On the convergence rate of the augmented Lagrangian-based parallel splitting method (Q4622886) (← links)
- A proximal partially parallel splitting method for separable convex programs (Q5268890) (← links)
- A new convergence proof of augmented Lagrangian-based method with full Jacobian decomposition for structured variational inequalities (Q5962805) (← links)
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems (Q5965003) (← links)
- Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval (Q6079303) (← links)
- A proximal fully parallel splitting method with a relaxation factor for separable convex programming (Q6086848) (← links)