Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting
From MaRDI portal
Publication:4624929
DOI10.1137/18M1168297zbMath1411.68176arXiv1804.11223OpenAlexW2963487288MaRDI QIDQ4624929
Publication date: 20 February 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.11223
Convex programming (90C25) Nonlinear programming (90C30) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items (3)
A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks ⋮ Convergence Rate Analysis of a Dykstra-Type Projection Algorithm ⋮ Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Proximity for sums of composite functions
- Dualization of signal recovery problems
- Distributed stochastic subgradient projection algorithms for convex optimization
- A cyclic projection algorithm via duality
- A successive projection method
- Two generalizations of Dykstra's cyclic projections algorithm
- Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Asynchronous parallel algorithms for nonconvex optimization
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
- On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
- An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
- A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
- Distributed Optimization Over Time-Varying Directed Graphs
- An Algorithm for Restricted Least Squares Regression
- General Projective Splitting Methods for Sums of Maximal Monotone Operators
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- On Projection Algorithms for Solving Convex Feasibility Problems
- Constrained Consensus and Optimization in Multi-Agent Networks
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- Asynchronous Distributed Optimization Via Randomized Dual Proximal Gradient
- A Distributed Boyle--Dykstra--Han Scheme
- On the Convergence of Block Coordinate Descent Type Methods
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem
- Convex analysis and monotone operator theory in Hilbert spaces
- Best approximation in inner product spaces
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting
