The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely
many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a …

We propose a geometric framework to describe and analyse a wide array of operator
splitting methods for solving monotone inclusion problems. The initial inclusion problem …

The Douglas–Rachford method is a splitting method frequently employed for finding zeros of
sums of maximally monotone operators. When the operators in question are normal cone …

We consider the convergence of the Douglas--Rachford splitting method (DRSM) for
minimizing the sum of a strongly convex function and a weakly convex function; this setting …

In this paper we present a variant of the proximal forward-backward splitting iteration for
solving nonsmooth optimization problems in Hilbert spaces, when the objective function is …

Recently, the convergence of the Douglas–Rachford splitting method (DRSM) was
established for minimizing the sum of a nonsmooth strongly convex function and a …

After re-casting the wavelet construction problem as a feasibility problem with constraints
arising from the requirements of compact support, smoothness and orthogonality, the …

After re-casting the $ n $-dimensional wavelet construction problem as a feasibility problem
with constraints arising from the requirements of compact support, smoothness and …

Convex feasibility problems require to find a point in the intersection of a finite family of
convex sets. We propose to solve such problems by performing set-enlargements and …

Discrete dynamical systems are ubiquitous in many mathematical disciplines. Celebrated
methods as old as the Hellenic period include Euclid's algorithm on Z2 and continued …