We develop two new algorithms, called, FedDR and asyncFedDR, for solving a fundamental
nonconvex composite optimization problem in federated learning. Our algorithms rely on a …

Abstract The Douglas–Rachford algorithm is an optimization method that can be used for
solving feasibility problems. To apply the method, it is necessary that the problem at hand is …

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 …

The Douglas--Rachford algorithm is a classical and powerful splitting method for minimizing
the sum of two convex functions and, more generally, finding a zero of the sum of two …

Recently, novel quaternion-valued wavelets on the plane were constructed using an
optimization approach. These wavelets are compactly supported, smooth, orthonormal …

We consider a class of generalized DC (difference-of-convex functions) programming, which
refers to the problem of minimizing the sum of two convex (possibly nonsmooth) functions …

In this paper, we study the generalized Douglas–Rachford algorithm and its cyclic variants
which include many projection-type methods such as the classical Douglas–Rachford …

In this paper, we consider a class of structured nonconvex nonsmooth optimization
problems, in which the objective function is formed by the sum of a possibly nonsmooth …

Recently, circumcentering reflection method (CRM) has been introduced for solving the
feasibility problem of finding a point in the intersection of closed constraint sets. It is closely …

We formulate the construction of quaternion-valued wavelets on the plane as a feasibility
problem. We refer to this as the quaternionic wavelet feasibility problem. The constraint sets …