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 …

For many problems, some of which are reviewed in the paper, popular algorithms like
Douglas–Rachford (DR), ADMM, and FISTA produce approximating sequences that show …

Given a Hilbert space and a finite family of operators defined on the space, the common
fixed point problem (CFPP) is the problem of finding a point in the intersection of the fixed …

In this paper, we propose a new algorithm combining the Douglas–Rachford (DR) algorithm
and the Frank–Wolfe algorithm, also known as the conditional gradient (CondG) method, for …

Jonathan Borwein was a founder and early champion of the field of experimental
mathematics. His high-profile accomplishments and extensive writing on the role of …

The classical convex feasibility problem in a finite dimensional Euclidean space consists of
finding a point in the intersection of two convex sets. In the present paper we are interested …

Given a Hilbert space and a finite family of operators defined on the space, the common
fixed point problem (CFPP) is the problem of finding a point in the intersection of the fixed …

Friedlander, Macêdo, and Pong recently introduced the projected polar proximal point
algorithm (P4A) for solving optimization problems by using the closed perspective …