80 citations · 471 across the 28 of their papers we have counts for
33 papers
Assortment optimization under the perception-adjusted Luce model
Gerardo Berbeglia, Mashbat Suzuki, Matthew Tam
The Perception-Adjusted Luce Model (PALM) introduced by by Echenique et al. (2018) is a sequential choice model that can accommodate violations of regularity and choice overload, b…
A First-Order Algorithm for Decentralised Min-Max Problems
Yura Malitsky, Matthew K. Tam
In this work, we consider a connected network of finitely many agents working cooperatively to solve a min-max problem with convex-concave structure. We propose a decentralised fir…
Frugal and Decentralised Resolvent Splittings Defined by Nonexpansive Operators
Matthew K. Tam
Frugal resolvent splittings are a class of fixed point algorithms for finding a zero in the sum of the sum of finitely many set-valued monotone operators, where the fixed point ope…
Single-Projection Procedure for Infinite Dimensional Convex Optimization Problems
Hoa T. Bui, Regina S. Burachik, Evgeni A. Nurminski +1
In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible po…
Bregman Golden Ratio Algorithms for Variational Inequalities
Matthew K. Tam, Daniel J. Uteda
Variational inequalities provide a framework through which many optimisation problems can be solved, in particular, saddle-point problems. In this paper, we study modifications to…
Distributed Forward-Backward Methods for Ring Networks
Francisco J. Aragón-Artacho, Yura Malitsky, Matthew K. Tam +1
In this work, we propose and analyse forward-backward-type algorithms for finding a zero of the sum of finitely many monotone operators, which are not based on reduction to a two o…
Resolvent Splitting for Sums of Monotone Operators with Minimal Lifting
Yura Malitsky, Matthew K. Tam
In this work, we study fixed point algorithms for finding a zero in the sum of maximally monotone operators by using their resolvents. More precisely, we consider the cla…
Method of Alternating Projection for the Absolute Value Equation
Jan Harold Alcantara, Jein-Shan Chen, Matthew K. Tam
A novel approach for solving the general absolute value equation where and is presented. We reformulate the equati…
Strengthened Splitting Methods for Computing Resolvents
Francisco J. Aragón Artacho, Rubén Campoy, Matthew K. Tam
In this work, we develop a systematic framework for computing the resolvent of the sum of two or more monotone operators which only activates each operator in the sum individually.…
Gearhart-Koshy Acceleration for Affine Subspaces
Matthew K. Tam
The method of cyclic projections finds nearest points in the intersection of finitely many affine subspaces. To accelerate convergence, Gearhart and Koshy proposed a modification w…
A Douglas-Rachford construction of non-separable continuous compactly supported multidimensional wavelets
David Franklin, Jeffrey A. Hogan, Matthew K. Tam
After re-casting the -dimensional wavelet construction problem as a feasibility problem with constraints arising from the requirements of compact support, smoothness and orthogo…
Constraint reduction reformulations for projection algorithms with applications to wavelet construction
Minh Dao, Neil Dizon, Jeffrey Hogan +1
We introduce a reformulation technique that converts a many-set feasibility problem into an equivalent two-set problem. This technique involves reformulating the original feasibili…
Convergence Rates for Boundedly Regular Systems
Ernö Robert Csetnek, Andrew Eberhard, Matthew K. Tam
In this work, we consider a continuous dynamical system associated with the fixed point set of a nonexpansive operator which was originally studied by Boţ & Csetnek (2015). Our mai…
Backward-Forward-Reflected-Backward Splitting for Three Operator Monotone Inclusions
Janosch Rieger, Matthew K. Tam
In this work, we propose and analyse two splitting algorithms for finding a zero of the sum of three monotone operators, one of which is assumed to be Lipschitz continuous. Each it…
The Douglas-Rachford Algorithm for Convex and Nonconvex Feasibility Problems
Francisco J. Aragón Artacho, Rubén Campoy, Matthew K. Tam
The Douglas-Rachford method, a projection algorithm designed to solve continuous optimization problems, forms the basis of a useful heuristic for solving combinatorial optimization…
Shadow Douglas--Rachford Splitting for Monotone Inclusions
Ernö Robert Csetnek, Yura Malitsky, Matthew K. Tam
In this work, we propose a new algorithm for finding a zero in the sum of two monotone operators where one is assumed to be single-valued and Lipschitz continuous. This algorithm n…
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…
A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity
Yura Malitsky, Matthew K. Tam
In this work, we propose a simple modification of the forward-backward splitting method for finding a zero in the sum of two monotone operators. Our method converges under the same…
Union Averaged Operators with Applications to Proximal Algorithms for Min-Convex Functions
Minh N. Dao, Matthew K. Tam
In this paper we introduce and study a class of structured set-valued operators which we call union averaged nonexpansive. At each point in their domain, the value of such an opera…
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…
Regularity Properties of Non-Negative Sparsity Sets
Matthew K. Tam
This paper investigates regularity properties of two non-negative sparsity sets: non-negative sparse vectors, and low-rank positive semi-definite matrices. Novel formulae for their…