Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems. - Francisco J. Aragón Artacho; Jonathan M. Borwein; Matthew K. Tam (J. Optim. Theory Appl., 2014)

A Cyclic Douglas-Rachford Iteration Scheme. - Jonathan M. Borwein; Matthew K. Tam (J. Optim. Theory Appl., 2014)

Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging. - Robert Hesse; D. Russell Luke; Shoham Sabach; Matthew K. Tam (SIAM J. Imaging Sci., 2015)

Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem. - Francisco J. Aragón Artacho; Jonathan M. Borwein; Matthew K. Tam (J. Glob. Optim., 2016)

Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems. - Jonathan M. Borwein; Guoyin Li 001; Matthew K. Tam (SIAM J. Optim., 2017)

Symbolic computation with monotone operators. - Florian Lauster; D. Russell Luke; Matthew K. Tam (ACM Commun. Comput. Algebra, 2018)

A feasibility approach for constructing combinatorial designs of circulant type. - Francisco J. Aragón Artacho; Rubén Campoy; Ilias S. Kotsireas; Matthew K. Tam (J. Comb. Optim., 2018)

Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings. - D. Russell Luke; Nguyen Hieu Thao; Matthew K. Tam (Math. Oper. Res., 2018)

Algorithms based on unions of nonexpansive maps. - Matthew K. Tam (Optim. Lett., 2018)

A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting. - Minh N. Dao; Matthew K. Tam (J. Glob. Optim., 2019)

Union Averaged Operators with Applications to Proximal Algorithms for Min-Convex Functions. - Minh N. Dao; Matthew K. Tam (J. Optim. Theory Appl., 2019)

Backward-Forward-Reflected-Backward Splitting for Three Operator Monotone Inclusions. - Janosch Rieger; Matthew K. Tam (Appl. Math. Comput., 2020)

The Douglas-Rachford algorithm for convex and nonconvex feasibility problems. - Francisco J. Aragón Artacho; Rubén Campoy; Matthew K. Tam (Math. Methods Oper. Res., 2020)

A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity. - Yura Malitsky; Matthew K. Tam (SIAM J. Optim., 2020)

Convergence rates for boundedly regular systems. - Ernö Robert Csetnek; Andrew C. Eberhard; Matthew K. Tam (Adv. Comput. Math., 2021)

Strengthened splitting methods for computing resolvents. - Francisco J. Aragón Artacho; Rubén Campoy; Matthew K. Tam (Comput. Optim. Appl., 2021)

Method of Alternating Projection for the Absolute Value Equation. - Jan Harold Alcantara; Jein-Shan Chen; Matthew K. Tam (CoRR, 2021)

Distributed Forward-Backward Methods without Central Coordination. - Francisco J. Aragón Artacho; Yura Malitsky; Matthew K. Tam; David Torregrosa-Belén (CoRR, 2021)

Constraint Reduction Reformulations for Projection Algorithms with Applications to Wavelet Construction. - Minh N. Dao; Neil D. Dizon; Jeffrey A. Hogan; Matthew K. Tam (J. Optim. Theory Appl., 2021)

Gearhart-Koshy acceleration for affine subspaces. - Matthew K. Tam (Oper. Res. Lett., 2021)

A First-Order Algorithm for Decentralised Min-Max Problems. - Yura Malitsky; Matthew K. Tam (CoRR, 2023)

Resolvent splitting for sums of monotone operators with minimal lifting. - Yura Malitsky; Matthew K. Tam (Math. Program., 2023)

Distributed forward-backward methods for ring networks. - Francisco J. Aragón Artacho; Yura Malitsky; Matthew K. Tam; David Torregrosa-Belén (Comput. Optim. Appl., 2023)

Bregman-Golden Ratio Algorithms for Variational Inequalities. - Matthew K. Tam; Daniel J. Uteda (J. Optim. Theory Appl., 2023)

Single-Projection Procedure for Infinite Dimensional Convex Optimization Problems. - Hoa T. Bui; Regina Sandra Burachik; Evgeni A. Nurminski; Matthew K. Tam (SIAM J. Optim., 2024)

Frugal and decentralised resolvent splittings defined by nonexpansive operators. - Matthew K. Tam (Optim. Lett., 2024)