12 citations · 51 across the 8 of their papers we have counts for
8 papers · 1 filter
Inertial Douglas-Rachford splitting for monotone inclusion problems
Radu Ioan Bot, Ernö Robert Csetnek, Christopher Hendrich
We propose an inertial Douglas-Rachford splitting algorithm for finding the set of zeros of the sum of two maximally monotone operators in Hilbert spaces and investigate its conver…
Convex risk minimization via proximal splitting methods
Radu Ioan Bot, Christopher Hendrich
In this paper we investigate the applicability of a recently introduced primal-dual splitting method in the context of solving portfolio optimization problems which assume the mini…
On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
Radu Ioan Bot, Ernö Robert Csetnek, Andre Heinrich
We present two modified versions of the primal-dual splitting algorithm relying on forward-backward splitting proposed in \cite{vu} for solving monotone inclusion problems. Under s…
A Douglas-Rachford type primal-dual method for solving inclusions with mixtures of composite and parallel-sum type monotone operators
Radu Ioan Bot, Christopher Hendrich
In this paper we propose two different primal-dual splitting algorithms for solving inclusions involving mixtures of composite and parallel-sum type monotone operators which rely o…
Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
Radu Ioan Bot, Christopher Hendrich
In this paper we investigate the convergence behavior of a primal-dual splitting method for solving monotone inclusions involving mixtures of composite, Lipschitzian and parallel s…
A variable smoothing algorithm for solving convex optimization problems
Radu Ioan Bot, Christopher Hendrich
In this article we propose a method for solving unconstrained optimization problems with convex and Lipschitz continuous objective functions. By making use of the Moreau envelopes…
On the acceleration of the double smoothing technique for unconstrained convex optimization problems
Radu Ioan Bot, Christopher Hendrich
In this article we investigate the possibilities of accelerating the double smoothing technique when solving unconstrained nondifferentiable convex optimization problems. This appr…
A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
Radu Ioan Bot, Christopher Hendrich
The aim of this paper is to develop an efficient algorithm for solving a class of unconstrained nondifferentiable convex optimization problems in finite dimensional spaces. To this…