Distributed Algorithms for Composite Optimization: Unified Framework and Convergence Analysis
From MaRDI portal
Cited in
(15)- Dualize, split, randomize: toward fast nonsmooth optimization algorithms
- Distributed composite optimization for multi-agent systems with asynchrony
- A resilient convex combination for consensus-based distributed algorithms
- EFIX: exact fixed point methods for distributed optimization
- scientific article; zbMATH DE number 1301749 (Why is no real title available?)
- scientific article; zbMATH DE number 6982986 (Why is no real title available?)
- Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation
- Balancing Communication and Computation in Distributed Optimization
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
- Optimal gradient tracking for decentralized optimization
- Distributed dual subgradient methods with averaging and applications to grid optimization
- Balancing communication and computation in gradient tracking algorithms for decentralized optimization
- Decentralized Learning of Quantile Regression: A Smoothing Approach
- Local adapt-then-combine algorithms for distributed nonsmooth optimization: achieving provable communication acceleration
- Decentralized sparse linear regression via gradient-tracking
This page was built for publication: Distributed Algorithms for Composite Optimization: Unified Framework and Convergence Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5103647)