The following pages link to (Q5260299):
Displaying 13 items.
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- A parallel splitting method for separable convex programs (Q382899) (← links)
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures (Q453611) (← links)
- A parallel Gauss-Seidel method for convex problems with separable structure (Q827578) (← links)
- A partially parallel prediction-correction splitting method for convex optimization problems with separable structure (Q1689069) (← links)
- A parallel splitting ALM-based algorithm for separable convex programming (Q2057225) (← links)
- Fast inexact decomposition algorithms for large-scale separable convex optimization (Q2790883) (← links)
- Sequential threshold control in descent splitting methods for decomposable optimization problems (Q3458841) (← links)
- An inexact hybrid splitting method for separable convex optimization (Q3463040) (← links)
- Study on the Splitting Methods for Separable Convex Optimization in a Unified Algorithmic Framework (Q4998188) (← links)
- A splitting method for separable convex programming (Q5174194) (← links)
- A proximal partially parallel splitting method for separable convex programs (Q5268890) (← links)
- A splitting algorithm for constrained optimization problems with parabolic equations (Q6102418) (← links)