DISA: a dual inexact splitting algorithm for distributed convex composite optimization
From MaRDI portal
Cited in
(3)- Inertial accelerated augmented Lagrangian algorithms with scaling coefficients to solve exactly and inexactly linearly constrained convex optimization problems
- Accelerated primal-dual methods for strongly convex objective functions in continuous and discrete time
- Local adapt-then-combine algorithms for distributed nonsmooth optimization: achieving provable communication acceleration
This page was built for publication: DISA: a dual inexact splitting algorithm for distributed convex composite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6588576)