default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew K. Tam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j23]Matthew K. Tam
:
Frugal and decentralised resolvent splittings defined by nonexpansive operators. Optim. Lett. 18(7): 1541-1559 (2024)- [j22]Hoa T. Bui, Regina Sandra Burachik, Evgeni A. Nurminski, Matthew K. Tam:
Single-Projection Procedure for Infinite Dimensional Convex Optimization Problems. SIAM J. Optim. 34(2): 1646-1678 (2024) - 2023
- [j21]Francisco J. Aragón Artacho, Yura Malitsky, Matthew K. Tam, David Torregrosa-Belén:
Distributed forward-backward methods for ring networks. Comput. Optim. Appl. 86(3): 845-870 (2023) - [j20]Matthew K. Tam, Daniel J. Uteda:
Bregman-Golden Ratio Algorithms for Variational Inequalities. J. Optim. Theory Appl. 199(3): 993-1021 (2023) - [j19]Yura Malitsky, Matthew K. Tam:
Resolvent splitting for sums of monotone operators with minimal lifting. Math. Program. 201(1): 231-262 (2023) - 2021
- [j18]Ernö Robert Csetnek, Andrew C. Eberhard, Matthew K. Tam:
Convergence rates for boundedly regular systems. Adv. Comput. Math. 47(5): 62 (2021) - [j17]Francisco J. Aragón Artacho, Rubén Campoy, Matthew K. Tam:
Strengthened splitting methods for computing resolvents. Comput. Optim. Appl. 80(2): 549-585 (2021) - [j16]Minh N. Dao, Neil D. Dizon, Jeffrey A. Hogan, Matthew K. Tam:
Constraint Reduction Reformulations for Projection Algorithms with Applications to Wavelet Construction. J. Optim. Theory Appl. 190(1): 201-233 (2021) - [j15]Matthew K. Tam:
Gearhart-Koshy acceleration for affine subspaces. Oper. Res. Lett. 49(2): 157-163 (2021) - 2020
- [j14]Janosch Rieger, Matthew K. Tam:
Backward-Forward-Reflected-Backward Splitting for Three Operator Monotone Inclusions. Appl. Math. Comput. 381: 125248 (2020) - [j13]Francisco J. Aragón Artacho, Rubén Campoy, Matthew K. Tam:
The Douglas-Rachford algorithm for convex and nonconvex feasibility problems. Math. Methods Oper. Res. 91(2): 201-240 (2020) - [j12]Yura Malitsky, Matthew K. Tam:
A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity. SIAM J. Optim. 30(2): 1451-1472 (2020) - 2019
- [j11]Minh N. Dao, Matthew K. Tam:
A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting. J. Glob. Optim. 73(1): 83-112 (2019) - [j10]Minh N. Dao, Matthew K. Tam:
Union Averaged Operators with Applications to Proximal Algorithms for Min-Convex Functions. J. Optim. Theory Appl. 181(1): 61-94 (2019) - 2018
- [j9]Florian Lauster, D. Russell Luke, Matthew K. Tam:
Symbolic computation with monotone operators. ACM Commun. Comput. Algebra 52(4): 139-141 (2018) - [j8]Francisco J. Aragón Artacho, Rubén Campoy, Ilias S. Kotsireas, Matthew K. Tam:
A feasibility approach for constructing combinatorial designs of circulant type. J. Comb. Optim. 35(4): 1061-1085 (2018) - [j7]D. Russell Luke, Nguyen Hieu Thao, Matthew K. Tam:
Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings. Math. Oper. Res. 43(4): 1143-1176 (2018) - [j6]Matthew K. Tam:
Algorithms based on unions of nonexpansive maps. Optim. Lett. 12(5): 1019-1027 (2018) - 2017
- [j5]Jonathan M. Borwein, Guoyin Li, Matthew K. Tam:
Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems. SIAM J. Optim. 27(1): 1-33 (2017) - 2016
- [j4]Francisco J. Aragón Artacho, Jonathan M. Borwein, Matthew K. Tam:
Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem. J. Glob. Optim. 65(2): 309-327 (2016) - 2015
- [j3]Robert Hesse, D. Russell Luke, Shoham Sabach, Matthew K. Tam:
Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging. SIAM J. Imaging Sci. 8(1): 426-457 (2015) - 2014
- [j2]Jonathan M. Borwein, Matthew K. Tam:
A Cyclic Douglas-Rachford Iteration Scheme. J. Optim. Theory Appl. 160(1): 1-29 (2014) - [j1]Francisco J. Aragón Artacho, Jonathan M. Borwein, Matthew K. Tam:
Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems. J. Optim. Theory Appl. 163(1): 1-30 (2014)
Informal and Other Publications
- 2023
- [i4]Yura Malitsky, Matthew K. Tam:
A First-Order Algorithm for Decentralised Min-Max Problems. CoRR abs/2308.11876 (2023) - 2022
- [i3]Matthew K. Tam:
Frugal and Decentralised Resolvent Splittings Defined by Nonexpansive Operators. CoRR abs/2211.04594 (2022) - 2021
- [i2]Jan Harold Alcantara, Jein-Shan Chen, Matthew K. Tam:
Method of Alternating Projection for the Absolute Value Equation. CoRR abs/2106.03268 (2021) - [i1]Francisco J. Aragón Artacho, Yura Malitsky, Matthew K. Tam, David Torregrosa-Belén:
Distributed Forward-Backward Methods without Central Coordination. CoRR abs/2112.00274 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
