9 papers
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…
A Note on Cores and Quasi Relative Interiors in Partially Finite Convex Programming
Scott B. Lindstrom
The problem of minimizing an entropy functional subject to linear constraints is a useful example of partially finite convex programming. In the 1990s, Borwein and Lewis provided b…
The Generalized Bregman Distance
Regina S. Burachik, Minh N. Dao, Scott B. Lindstrom
Recently, a new distance has been introduced for the graphs of two point-to-set operators, one of which is maximally monotone. When both operators are the subdifferential of a prop…
Phase Portraits of Hyperbolic Geometry
Scott B. Lindstrom, Paul Vrbik
Phase plotting is a useful way of visualising functions on complex space. We reinvent the method in the context of hyperbolic geometry, and we use it to plot functions on various r…
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…