6 papers · 1 filter
Centering Projection Methods for Wavelet Feasibility Problems
Neil Dizon, Jeffrey Hogan, Scott B. Lindstrom
We revisit the feasibility approach to the construction of compactly supported smooth orthogonal wavelets on the line. We highlight its flexibility and illustrate how symmetry and…
Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples
R. Díaz Millán, Scott B. Lindstrom, Vera Roshchina
We focus on the convergence analysis of averaged relaxations of cutters, specifically for variants that---depending upon how parameters are chosen---resemble \emph{alternating proj…
Survey: Sixty Years of Douglas--Rachford
Scott B. Lindstrom, Brailey Sims
The Douglas--Rachford method is a splitting method frequently employed for finding zeroes of sums of maximally monotone operators. When the operators in question are normal cones o…
Proximal Averages for Minimization of Entropy Functionals
Heinz H. Bauschke, Scott B. Lindstrom
In their 2016 article `Meetings with Lambert and Other Special Functions in Optimization and Analysis', Borwein and Lindstrom considered the minimization of an entrop…
VADU 2018 Open Problem Session
Bui Thi Hoa, Scott Lindstrom, Vera Roshchina
We state the problems discussed in the open problem session at Variational Analysis Down Under (VADU2018) conference held in honour of Prof. Asen Dontchev's 70th birthday on 19--21…
The Douglas--Rachford algorithm for a hyperplane and a doubleton
Heinz H. Bauschke, Minh N. Dao, Scott B. Lindstrom
The Douglas--Rachford algorithm is a popular algorithm for solving both convex and nonconvex feasibility problems. While its behaviour is settled in the convex inconsistent case, t…