168 citations · 486 across the 27 of their papers we have counts for
4 papers · 1 filter
On Fejér monotone sequences and nonexpansive mappings
H. H. Bauschke, M. N. Dao, W. M. Moursi
The notion of Fejér monotonicity has proven to be a fruitful concept in fixed point theory and optimization. In this paper, we present new conditions sufficient for convergence of…
The Douglas-Rachford algorithm in the affine-convex case
Heinz H. Bauschke, Minh N. Dao, Walaa M. Moursi
The Douglas-Rachford algorithm is a simple yet effective method for solving convex feasibility problems. However, if the underlying constraints are inconsistent, then the convergen…
On Slater's condition and finite convergence of the Douglas-Rachford algorithm
Heinz H. Bauschke, Minh N. Dao, Dominikus Noll +1
The Douglas-Rachford algorithm is a classical and very successful method for solving optimization and feasibility problems. In this paper, we provide novel conditions sufficient fo…
Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
Heinz H. Bauschke, Minh N. Dao, Dominikus Noll +1
Many iterative methods for solving optimization or feasibility problems have been invented, and often convergence of the iterates to some solution is proven. Under favourable condi…