21 citations · 44 across the 40 of their papers we have counts for
5 papers · 1 filter
Regularized Nonsmooth Newton Algorithms for Best Approximation
Yair Censor, Walaa M. Moursi, Tyler Weames +1
We consider the problem of finding the best approximation point from a polyhedral set, and its applications, in particular to solving large-scale linear programs. The classical pro…
How to project onto the intersection of a closed affine subspace and a hyperplane
Heinz H. Bauschke, Dayou Mao, Walaa M. Moursi
Let be a closed affine subspace and let be a hyperplane in a Hilbert space. Suppose we are given their associated nearest point mappings and , respectively. We p…
The range of the Douglas-Rachford operator in infinite-dimensional Hilbert spaces
Walaa M. Moursi
The Douglas-Rachford algorithm is one of the most prominent splitting algorithms for solving convex optimization problems. Recently, the method has been successful in finding a gen…
Strongly nonexpansive mappings revisited: uniform monotonicity and operator splitting
Leon Liu, Walaa M. Moursi, Jon Vanderwerff
The correspondence between the class of nonexpansive mappings and the class of maximally monotone operators via the reflected resolvents of the latter has played an instrumental ro…
On the Douglas-Rachford and Peaceman-Rachford algorithms in the presence of uniform monotonicity and the absence of minimizers
Regina S. Burachik, Bethany I. Caldwell, C. Yalçın Kaya +2
The Douglas-Rachford and Peaceman-Rachford algorithms have been successfully employed to solve convex optimization problems, or more generally find zeros of monotone inclusions. Re…