In this article, we propose and study a stochastic preconditioned Douglas-Rachford splitting method to solve saddle-point problems which have separable dual variables. We prove the almost sure convergence of the iteration sequences in Hilbert spaces for a class of convexconcave and nonsmooth saddle-point problems. We also provide the sublinear convergence rate for the ergodic sequence with respect to the expectation of the restricted primal-dual gap functions. Numerical experiments show the high efficiency of the proposed stochastic preconditioned Douglas-Rachford splitting methods
We propose a new approach for analyzing convergence of the Douglas-Rachford splitting method for sol...
We propose a new approach for analyzing convergence of the Douglas-Rachford splitting method for sol...
International audienceOver the past decades, operator splitting methods have become ubiquitous for n...
We investigate the convergence properties of a stochastic primal-dual splitting algorithmfor solving...
The Douglas Rachford algorithm is an algorithm that converges to a minimizer of a sum of two convex ...
International audienceWe study a stochastic first order primal-dual method for solving convex-concav...
In this work we propose a stochastic primal-dual preconditioned three-operator splitting algorithm f...
Employing the ideas of non-linear preconditioning and testing of the classical proximal point method...
We introduce two stage stochastic semidefinite programs with recourse and present a Benders decompos...
We adapt the Douglas–Rachford (DR) splitting method to solve nonconvex feasibility problems by study...
© 2014 IEEE. We propose a new approach for analyzing convergence of the Douglas-Rachford splitting m...
International audienceWe consider convex-concave saddle-point problems where the objective functions...
A new stochastic primal-dual algorithm for solving a composite optimization problem is proposed. It ...
This thesis is concerned with the development of novel numerical methods for solving nondifferentiab...
The Douglas–Rachford algorithm is a very popular splitting technique for finding a zero of the sum ...
We propose a new approach for analyzing convergence of the Douglas-Rachford splitting method for sol...
We propose a new approach for analyzing convergence of the Douglas-Rachford splitting method for sol...
International audienceOver the past decades, operator splitting methods have become ubiquitous for n...
We investigate the convergence properties of a stochastic primal-dual splitting algorithmfor solving...
The Douglas Rachford algorithm is an algorithm that converges to a minimizer of a sum of two convex ...
International audienceWe study a stochastic first order primal-dual method for solving convex-concav...
In this work we propose a stochastic primal-dual preconditioned three-operator splitting algorithm f...
Employing the ideas of non-linear preconditioning and testing of the classical proximal point method...
We introduce two stage stochastic semidefinite programs with recourse and present a Benders decompos...
We adapt the Douglas–Rachford (DR) splitting method to solve nonconvex feasibility problems by study...
© 2014 IEEE. We propose a new approach for analyzing convergence of the Douglas-Rachford splitting m...
International audienceWe consider convex-concave saddle-point problems where the objective functions...
A new stochastic primal-dual algorithm for solving a composite optimization problem is proposed. It ...
This thesis is concerned with the development of novel numerical methods for solving nondifferentiab...
The Douglas–Rachford algorithm is a very popular splitting technique for finding a zero of the sum ...
We propose a new approach for analyzing convergence of the Douglas-Rachford splitting method for sol...
We propose a new approach for analyzing convergence of the Douglas-Rachford splitting method for sol...
International audienceOver the past decades, operator splitting methods have become ubiquitous for n...