A Proximal Gradient Algorithm for Decentralized Composite Optimization
From MaRDI portal
Publication:4580911
DOI10.1109/TSP.2015.2461520zbMATH Open1394.94531OpenAlexW1627780903MaRDI QIDQ4580911FDOQ4580911
Authors: Wei Shi, Qing Ling, Gang Wu, Wotao Yin 
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2015.2461520
Cited In (38)
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
- Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods
- New convergence analysis of a primal-dual algorithm with large stepsizes
- Communication-efficient algorithms for decentralized and stochastic optimization
- Distributed nonconvex constrained optimization over time-varying digraphs
- A decentralized Nesterov gradient method for stochastic optimization over unbalanced directed networks
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation
- Title not available (Why is that?)
- Distributed subgradient method for multi-agent optimization with quantized communication
- Title not available (Why is that?)
- Distributed accelerated gradient methods with restart under quadratic growth condition
- On the linear convergence of two decentralized algorithms
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- A fast proximal gradient algorithm for decentralized composite optimization over directed networks
- Golden ratio proximal gradient ADMM for distributed composite convex optimization
- Majority vote for distributed differentially private sign selection
- A distributed methodology for approximate uniform global minimum sharing
- Distributed regularized online optimization using forward-backward splitting
- A fixed step distributed proximal gradient push‐pull algorithm based on integral quadratic constraint
- Decentralized proximal splitting algorithms for composite constrained convex optimization
- Distributed decision-coupled constrained optimization via proximal-tracking
- A distributed proximal gradient method with time-varying delays for solving additive convex optimizations
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
- Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
- GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
- Revisiting EXTRA for Smooth Distributed Optimization
- Surrogate-based distributed optimisation for expensive black-box functions
- Distributed consensus-based multi-agent convex optimization via gradient tracking technique
- Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints
- Stochastic proximal splitting algorithm for composite minimization
- A divide-and-conquer algorithm for distributed optimization on networks
- Edge-based distributed primal-dual algorithms for seeking generalized Nash equilibria
- Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks
- Distributed composite optimization for multi-agent systems with asynchrony
- A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities
- An Optimal Algorithm for Decentralized Finite-Sum Optimization
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)
