A Class of Randomized Primal-Dual Algorithms for Distributed Optimization
From MaRDI portal
Publication:2789080
zbMath1336.65113arXiv1406.6404MaRDI QIDQ2789080
Audrey Repetti, Jean-Christophe Pesquet
Publication date: 26 February 2016
Full work available at URL: https://arxiv.org/abs/1406.6404
convex optimizationpreconditioningmonotone operatordistributed algorithmprimal-dual algorithmblock-coordinate algorithmstochastic quasi-Fejér sequence
Convex programming (90C25) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Decomposition methods (49M27)
Related Items (28)
Block delayed Majorize-Minimize subspace algorithm for large scale image restoration * ⋮ Almost sure convergence of the forward-backward-forward splitting algorithm ⋮ Convergence properties of a randomized primal-dual algorithm with applications to parallel MRI ⋮ Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems ⋮ On the ergodic convergence rates of a first-order primal-dual algorithm ⋮ Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings ⋮ Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays ⋮ Proximal point algorithms for nonsmooth convex optimization with fixed point constraints ⋮ Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators ⋮ On the Convergence of Stochastic Primal-Dual Hybrid Gradient ⋮ Multivariate Monotone Inclusions in Saddle Form ⋮ A decomposition method for solving multicommodity network equilibria ⋮ Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions ⋮ Convergence Rate Analysis of Primal-Dual Splitting Schemes ⋮ Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications ⋮ A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression ⋮ Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences ⋮ Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming ⋮ Variable smoothing for convex optimization problems using stochastic gradients ⋮ A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions ⋮ Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization ⋮ Single-forward-step projective splitting: exploiting cocoercivity ⋮ Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications ⋮ Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs ⋮ Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization ⋮ Block-proximal methods with spatially adapted acceleration ⋮ A randomized incremental primal-dual method for decentralized consensus optimization ⋮ Convergence analysis of the stochastic reflected forward-backward splitting algorithm
This page was built for publication: A Class of Randomized Primal-Dual Algorithms for Distributed Optimization