70 citations · 295 across the 74 of their papers we have counts for
6 papers · 1 filter
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…
A primal-dual splitting algorithm for finding zeros of sums of maximally monotone operators
Radu Ioan Bot, Ernö Robert Csetnek, Andre Heinrich
We consider the primal problem of finding the zeros of the sum of a maximally monotone operator with the composition of another maximally monotone operator with a linear continuous…
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…