A class of randomized primal-dual algorithms for distributed optimization
From MaRDI portal
Abstract: Based on a preconditioned version of the randomized block-coordinate forward-backward algorithm recently proposed in [Combettes,Pesquet,2014], several variants of block-coordinate primal-dual algorithms are designed in order to solve a wide array of monotone inclusion problems. These methods rely on a sweep of blocks of variables which are activated at each iteration according to a random rule, and they allow stochastic errors in the evaluation of the involved operators. Then, this framework is employed to derive block-coordinate primal-dual proximal algorithms for solving composite convex variational problems. The resulting algorithm implementations may be useful for reducing computational complexity and memory requirements. Furthermore, we show that the proposed approach can be used to develop novel asynchronous distributed primal-dual algorithms in a multi-agent context.
Recommendations
- scientific article; zbMATH DE number 7042549
- Primal-dual stochastic distributed algorithm for constrained convex optimization
- A New Randomized Block-Coordinate Primal-Dual Proximal Algorithm for Distributed Optimization
- Fast Distributed Algorithms Via Primal-Dual (Extended Abstract)
- Primal-dual algorithm for distributed constrained optimization
- Randomized Algorithms for Distributed Nonlinear Optimization Under Sparsity Constraints
- Primal-dual -subgradient method for distributed optimization
- A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
- A randomized incremental primal-dual method for decentralized consensus optimization
- Distributed Primal–Dual Splitting Algorithm for Multiblock Separable Optimization Problems
Cited in
(44)- Convergence properties of a randomized primal-dual algorithm with applications to parallel MRI
- Primal-dual stochastic distributed algorithm for constrained convex optimization
- Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Convergence in distribution of randomized algorithms: the case of partially separable optimization
- A Distributed Block-Split Gibbs Sampler with Hypergraph Structure for High-Dimensional Inverse Problems
- A modification of the forward-backward splitting method for monotone inclusions
- Almost sure convergence of the forward-backward-forward splitting algorithm
- Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
- A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
- Variable smoothing for convex optimization problems using stochastic gradients
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization
- Distributed Primal Decomposition for Large-Scale MILPs
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- A Smooth Double Proximal Primal-Dual Algorithm for a Class of Distributed Nonsmooth Optimization Problems
- The geometry of monotone operator splitting methods
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- Single-forward-step projective splitting: exploiting cocoercivity
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Block-proximal methods with spatially adapted acceleration
- Multivariate Monotone Inclusions in Saddle Form
- Two new splitting methods for three-operator monotone inclusions in Hilbert spaces
- Preconditioning of a generalized forward-backward splitting and application to optimization on graphs
- A generalization of the forward-reflected-backward splitting method for monotone inclusions
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
- On the convergence of stochastic primal-dual hybrid gradient
- A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
- Fast warped iteration for nonmonotone inclusions with a convergence rate of o (1k)
- Convergence Rate Analysis of Primal-Dual Splitting Schemes
- A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression
- An inertial reflected-forward-backward splitting method for monotone inclusions with improved step size
- Convergence analysis of the stochastic reflected forward-backward splitting algorithm
- Almost-surely convergent randomly activated monotone operator splitting methods
- A randomized incremental primal-dual method for decentralized consensus optimization
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
- Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
- Block delayed Majorize-Minimize subspace algorithm for large scale image restoration *
- A decomposition method for solving multicommodity network equilibria
- DSCOVR: randomized primal-dual block coordinate algorithms for asynchronous distributed optimization
- Scalable Bayesian uncertainty quantification in imaging inverse problems via convex optimization
This page was built for publication: A class of randomized primal-dual algorithms for distributed optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789080)
