20 citations · 20 across the 2 of their papers we have counts for
5 papers
Fixing and extending some recent results on the ADMM algorithm
Sebastian Banert, Radu Ioan Bot, Ernö Robert Csetnek
We investigate the techniques and ideas used in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear…
A general double-proximal gradient algorithm for d.c. programming
Sebastian Banert, Radu Ioan Bot
The possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to varian…
A forward-backward-forward differential equation and its asymptotic properties
Sebastian Banert, Radu Ioan Bot
In this paper, we approach the problem of finding the zeros of the sum of a maximally monotone operator and a monotone and Lipschitz continuous one in a real Hilbert space via an i…
Backward Penalty Schemes for Monotone Inclusion Problems
Sebastian Banert, Radu Ioan Bot
In this paper we are concerned with solving monotone inclusion problems expressed by the sum of a set-valued maximally monotone operator with a single-valued maximally monotone one…
Backward-Backward Splitting in Hadamard Spaces
Sebastian Banert
The backward-backward algorithm is a tool for finding minima of a regularization of the sum of two convex functions in Hilbert spaces. We generalize this setting to Hadamard spaces…