A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates
From MaRDI portal
(Redirected from Publication:5238993)
Cited in
(33)- New convergence analysis of a primal-dual algorithm with large stepsizes
- On the linear convergence of two decentralized algorithms
- Distributed decision-coupled constrained optimization via proximal-tracking
- Distributed composite optimization for multi-agent systems with asynchrony
- Distribution agnostic Bayesian compressive sensing with incremental support estimation
- Decentralized proximal splitting algorithms for composite constrained convex optimization
- Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization
- Fast decentralized nonconvex finite-sum optimization with recursive variance reduction
- Distributed smooth optimisation with event-triggered proportional-integral algorithms
- Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation
- Decentralized Accelerated Gradient Methods With Increasing Penalty Parameters
- scientific article; zbMATH DE number 7307473 (Why is no real title available?)
- An Optimal Algorithm for Decentralized Finite-Sum Optimization
- Decentralized ADMM with compressed and event-triggered communication
- An asynchronous subgradient-proximal method for solving additive convex optimization problems
- A distributed proximal gradient method with time-varying delays for solving additive convex optimizations
- A divide-and-conquer algorithm for distributed optimization on networks
- Understanding a Class of Decentralized and Federated Optimization Algorithms: A Multirate Feedback Control Perspective
- A Unified Framework for Continuous-Time Unconstrained Distributed Optimization
- Golden ratio proximal gradient ADMM for distributed composite convex optimization
- A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates
- Optimal gradient tracking for decentralized optimization
- An accelerated decentralized stochastic optimization algorithm with inexact model
- A decentralized proximal gradient tracking algorithm for composite optimization on Riemannian manifolds
- Decentralized projected Riemannian gradient method for smooth optimization on compact submanifolds embedded in the Euclidean space
- Fast and Robust Low-Rank Learning over Networks: A Decentralized Matrix Quantile Regression Approach
- Convergence of an accelerated distributed optimisation algorithm over time-varying directed networks
- An accelerated primal dual algorithm with backtracking for decentralized constrained optimization
- Local adapt-then-combine algorithms for distributed nonsmooth optimization: achieving provable communication acceleration
- A first-order algorithm for decentralised min-max problems
- Exploiting agent symmetries for performance analysis of distributed optimization methods
- Clipped stochastic gradient tracking for locally smooth functions
- Efficient Distributed Learning over Decentralized Networks with Convoluted Support Vector Machine
This page was built for publication: A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5238993)
