This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Borwein, Jonathan M. Sims, Brailey and Tam, Matthew K. 2015. Norm convergence of realistic projection and reflection methods. Optimization, Vol. 64, Issue. 1, p. 161.
Aragón Artacho, Francisco J. Borwein, Jonathan M. and Tam, Matthew K. 2016. Global behavior of the Douglas–Rachford method for a nonconvex feasibility problem. Journal of Global Optimization, Vol. 65, Issue. 2, p. 309.
Censor, Yair and Mansour, Rafiq 2016. New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses. SIAM Journal on Optimization, Vol. 26, Issue. 1, p. 474.
Yu, Yongchao Peng, Jigen Han, Xuanli and Cui, Angang 2017. A Primal Douglas–Rachford Splitting Method for the Constrained Minimization Problem in Compressive Sensing. Circuits, Systems, and Signal Processing, Vol. 36, Issue. 10, p. 4022.
Borwein, Jonathan M. and Tam, Matthew K. 2017. Generalized Nash Equilibrium Problems, Bilevel Programming and MPEC. p. 83.
Tam, Matthew K. 2017. Regularity properties of non-negative sparsity sets. Journal of Mathematical Analysis and Applications, Vol. 447, Issue. 2, p. 758.
Aragón Artacho, Francisco J. and Campoy, Rubén 2018. A new projection method for finding the closest point in the intersection of convex sets. Computational Optimization and Applications, Vol. 69, Issue. 1, p. 99.
Borwein, Jonathan M. Lindstrom, Scott B. Sims, Brailey Schneider, Anna and Skerritt, Matthew P. 2018. Dynamics of the Douglas-Rachford Method for Ellipses and p-Spheres. Set-Valued and Variational Analysis, Vol. 26, Issue. 2, p. 385.
Aragón Artacho, Francisco J. and Campoy, Rubén 2018. Solving Graph Coloring Problems with the Douglas-Rachford Algorithm. Set-Valued and Variational Analysis, Vol. 26, Issue. 2, p. 277.
Behling, R. Bello-Cruz, J.Y. and Santos, L.-R. 2018. On the linear convergence of the circumcentered-reflection method. Operations Research Letters, Vol. 46, Issue. 2, p. 159.
Aragón Artacho, Francisco J. Campoy, Rubén Kotsireas, Ilias and Tam, Matthew K. 2018. A feasibility approach for constructing combinatorial designs of circulant type. Journal of Combinatorial Optimization, Vol. 35, Issue. 4, p. 1061.
Liu, Yanli and Yin, Wotao 2019. An Envelope for Davis–Yin Splitting and Strict Saddle-Point Avoidance. Journal of Optimization Theory and Applications, Vol. 181, Issue. 2, p. 567.
Ryu, Ernest K. Liu, Yanli and Yin, Wotao 2019. Douglas–Rachford splitting and ADMM for pathological convex optimization. Computational Optimization and Applications, Vol. 74, Issue. 3, p. 747.
Kline, Jeffery 2019. Geometric search for Hadamard matrices. Theoretical Computer Science, Vol. 778, Issue. , p. 33.
Franklin, David Hogan, Jeffrey A. and Tam, Matthew 2019. Higher-dimensional wavelets and the Douglas-Rachford algorithm. p. 1.
Aragón Artacho, Francisco J. Campoy, Rubén and Elser, Veit 2020. An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm. Journal of Global Optimization, Vol. 77, Issue. 2, p. 383.
Millán, Reinier Díaz Lindstrom, Scott B. and Roshchina, Vera 2020. From Analysis to Visualization. Vol. 313, Issue. , p. 75.
Aragón Artacho, Francisco J. Campoy, Rubén and Tam, Matthew K. 2020. The Douglas–Rachford algorithm for convex and nonconvex feasibility problems. Mathematical Methods of Operations Research, Vol. 91, Issue. 2, p. 201.
Dao, Minh N. Dizon, Neil D. Hogan, Jeffrey A. and Tam, Matthew K. 2021. Constraint Reduction Reformulations for Projection Algorithms with Applications to Wavelet Construction. Journal of Optimization Theory and Applications, Vol. 190, Issue. 1, p. 201.
Feng, Junkai Zhang, Haibin Zhang, Kaili and Zhao, Pengfei 2021. An inertial Douglas–Rachford splitting algorithm for nonconvex and nonsmooth problems. Concurrency and Computation: Practice and Experience,