552 citations · 1.2k across the 33 of their papers we have counts for
6 papers · 1 filter
Convergence Analysis of the Relaxed Douglas-Rachford Algorithm
D. Russell Luke, Anna-Lena Martins
Motivated by nonconvex, inconsistent feasibility problems in imaging, the relaxed alternating averaged reflections algorithm, or relaxed Douglas-Rachford algorithm (DR), was fir…
Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
D. Russell Luke, Shoham Sabach, Marc Teboulle
We present a unified treatment of the abstract problem of finding the best approximation between a cone and spheres in the image of affine transformations. Prominent instances of t…
Random Function Iterations for Consistent Stochastic Feasibility
Neal Hermer, D. Russell Luke, Anja Sturm
We study the convergence of stochastic fixed point iterations in the consistent case (in the sense of Butnariu and Flåm (1995)) in several different settings, under decreasingly re…
Characterizations of Super-regularity and its Variants
Aris Daniilidis, D. Russell Luke, Matthew K. Tam
Convergence of projection-based methods for nonconvex set feasibility problems has been established for sets with ever weaker regularity assumptions. What has not kept pace with th…
Phase retrieval with sparse phase constraint
Hieu Thao Nguyen, D. Russell Luke, Oleg Soloviev +1
For the first time, this paper investigates the phase retrieval problem with the assumption that the phase (of the complex signal) is sparse in contrast to the sparsity assumption…
Block-coordinate primal-dual method for the nonsmooth minimization over linear constraints
D. Russell Luke, Yura Malitsky
We consider the problem of minimizing a convex, separable, nonsmooth function subject to linear constraints. The numerical method we propose is a block-coordinate extension of the…