A Proximal Gradient Algorithm for Decentralized Composite Optimization
From MaRDI portal
Publication:4580911
Cited in
(38)- Distributed composite optimization for multi-agent systems with asynchrony
- Communication-efficient algorithms for decentralized and stochastic optimization
- Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation
- An Optimal Algorithm for Decentralized Finite-Sum Optimization
- Majority vote for distributed differentially private sign selection
- Distributed decision-coupled constrained optimization via proximal-tracking
- Distributed subgradient method for multi-agent optimization with quantized communication
- GADMM: fast and communication efficient framework for distributed machine learning
- A distributed methodology for approximate uniform global minimum sharing
- Distributed nonconvex constrained optimization over time-varying digraphs
- Edge-based distributed primal-dual algorithms for seeking generalized Nash equilibria
- Distributed consensus-based multi-agent convex optimization via gradient tracking technique
- Distributed accelerated gradient methods with restart under quadratic growth condition
- On the linear convergence of two decentralized algorithms
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
- A distributed proximal gradient method with time-varying delays for solving additive convex optimizations
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
- Distributed regularized online optimization using forward-backward splitting
- A decentralized Nesterov gradient method for stochastic optimization over unbalanced directed networks
- New convergence analysis of a primal-dual algorithm with large stepsizes
- Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints
- Revisiting EXTRA for Smooth Distributed Optimization
- Decentralized proximal splitting algorithms for composite constrained convex optimization
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Global convergence rate of proximal incremental aggregated gradient methods
- Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
- A fixed step distributed proximal gradient push‐pull algorithm based on integral quadratic constraint
- A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities
- Surrogate-based distributed optimisation for expensive black-box functions
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- A fast proximal gradient algorithm for decentralized composite optimization over directed networks
- scientific article; zbMATH DE number 7307473 (Why is no real title available?)
- Stochastic proximal splitting algorithm for composite minimization
- A divide-and-conquer algorithm for distributed optimization on networks
- Distributed stochastic variance reduced gradient methods by sampling extra data with replacement
- Golden ratio proximal gradient ADMM for distributed composite convex optimization
- Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization
This page was built for publication: A Proximal Gradient Algorithm for Decentralized Composite Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580911)
