A Proximal Gradient Algorithm for Decentralized Composite Optimization
From MaRDI portal
(Redirected from Publication:4580911)
Cited in
(49)- A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities
- An Optimal Algorithm for Decentralized Finite-Sum Optimization
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
- New convergence analysis of a primal-dual algorithm with large stepsizes
- Communication-efficient algorithms for decentralized and stochastic optimization
- Fast and Robust Low-Rank Learning over Networks: A Decentralized Matrix Quantile Regression Approach
- Frugal and decentralised resolvent splittings defined by nonexpansive operators
- Distributed nonconvex constrained optimization over time-varying digraphs
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- A decentralized Nesterov gradient method for stochastic optimization over unbalanced directed networks
- Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation
- GADMM: fast and communication efficient framework for distributed machine learning
- Distributed subgradient method for multi-agent optimization with quantized communication
- scientific article; zbMATH DE number 7307473 (Why is no real title available?)
- Differentially private regularized stochastic convex optimization with heavy-tailed data
- Distributed accelerated gradient methods with restart under quadratic growth condition
- On the linear convergence of two decentralized algorithms
- Robust and efficient sparse learning over networks: a decentralized surrogate composite quantile regression approach
- Coordinate-update algorithms can efficiently detect infeasible optimization problems
- Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization
- A fast proximal gradient algorithm for decentralized composite optimization over directed networks
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- An accelerated primal dual algorithm with backtracking for decentralized constrained optimization
- Golden ratio proximal gradient ADMM for distributed composite convex optimization
- Majority vote for distributed differentially private sign selection
- Global convergence rate of proximal incremental aggregated gradient methods
- A distributed methodology for approximate uniform global minimum sharing
- Distributed regularized online optimization using forward-backward splitting
- Distributed stochastic variance reduced gradient methods by sampling extra data with replacement
- A fixed step distributed proximal gradient push‐pull algorithm based on integral quadratic constraint
- Local adapt-then-combine algorithms for distributed nonsmooth optimization: achieving provable communication acceleration
- A first-order algorithm for decentralised min-max problems
- 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
- A decentralized proximal gradient tracking algorithm for composite optimization on Riemannian manifolds
- Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
- Distributed prediction-correction algorithm for convex optimization with coupled constraints
- Revisiting EXTRA for Smooth Distributed Optimization
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
- AB /Push-Pull method for distributed optimization in time-varying directed networks
- Surrogate-based distributed optimisation for expensive black-box functions
- Distributed consensus-based multi-agent convex optimization via gradient tracking technique
- Stochastic proximal splitting algorithm for composite minimization
- Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints
- A divide-and-conquer algorithm for distributed optimization on networks
- Distributed composite optimization for multi-agent systems with asynchrony
- Edge-based distributed primal-dual algorithms for seeking generalized Nash equilibria
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)
