Pages that link to "Item:Q1753069"
From MaRDI portal
The following pages link to Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization (Q1753069):
Displaying 11 items.
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (Q2062324) (← links)
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (Q2220653) (← links)
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (Q2220658) (← links)
- Randomized primal-dual proximal block coordinate updates (Q2314059) (← links)
- Block-proximal methods with spatially adapted acceleration (Q2323015) (← links)
- New method for solving Ivanov regularization-based support vector machine learning (Q2669598) (← links)
- Accelerated block-coordinate relaxation for regularized optimization (Q2902875) (← links)
- Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming (Q4976160) (← links)
- A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
- Distributed optimal consensus of multi-agent systems: a randomized parallel approach (Q6537292) (← links)
