80 citations · 471 across the 28 of their papers we have counts for
4 papers · 1 filter
A feasibility approach for constructing combinatorial designs of circulant type
Francisco J. Aragón Artacho, Rubén Campoy, Ilias Kotsireas +1
In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelations. The problem…
Algorithms Based on Unions of Nonexpansive Maps
Matthew K. Tam
In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in th…
A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm
Minh N. Dao, Matthew K. Tam
The Douglas-Rachford projection algorithm is an iterative method used to find a point in the intersection of closed constraint sets. The algorithm has been experimentally observed…
Symbolic computation with monotone operators
Florian Lauster, D. Russell Luke, Matthew K. Tam
We consider a class of monotone operators which are appropriate for symbolic representation and manipulation within a computer algebra system. Various structural properties of the…