A stochastic preconditioned Douglas-Rachford splitting method for saddle-point problems
From MaRDI portal
Cites work
- A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A simplified proof of weak convergence in Douglas-Rachford method
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- Convergence Analysis of the Relaxed Douglas--Rachford Algorithm
- Convergence rates of inertial forward-backward algorithms
- Convex analysis and monotone operator theory in Hilbert spaces
- Degenerate Preconditioned Proximal Point Algorithms
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- Incremental proximal methods for large scale convex optimization
- Inverse problems with Poisson data: statistical regularization theory, applications and algorithms
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the convergence of stochastic primal-dual hybrid gradient
- On the convergence rate of Douglas-Rachford operator splitting method
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Parallel coordinate descent methods for big data optimization
- Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems
- Preconditioned Douglas-Rachford algorithms for TV- and TGV-regularized variational imaging problems
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Robust Stochastic Approximation Approach to Stochastic Programming
- Split-Douglas-Rachford algorithm for composite monotone inclusions and split-ADMM
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Stochastic dual coordinate ascent methods for regularized loss minimization
- Stochastic primal-dual coordinate method for regularized empirical risk minimization
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence
- Total generalized variation
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(1)
This page was built for publication: A stochastic preconditioned Douglas-Rachford splitting method for saddle-point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939697)
