30 citations · 80 across the 16 of their papers we have counts for
4 papers · 1 filter
Error bounds, facial residual functions and applications to the exponential cone
Scott B. Lindstrom, Bruno F. Lourenço, Ting Kei Pong
We construct a general framework for deriving error bounds for conic feasibility problems. In particular, our approach allows one to work with cones that fail to be amenable or eve…
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…
Computable Centering Methods for Spiraling Algorithms and their Duals, with Motivations from the theory of Lyapunov Functions
Scott B. Lindstrom
For many problems, some of which are reviewed in the paper, popular algorithms like Douglas--Rachford (DR), ADMM, and FISTA produce approximating sequences that show signs of spira…