Finding magic squares with Douglas--Rachford algorithm

• Autores: Francisco J. Aragón Artacho , Paula Segura
• Localización: BEIO, Boletín de Estadística e Investigación Operativa, ISSN 1889-3805, Vol. 35, Nº. 2, 2019, págs. 106-129
• Idioma: inglés
• Enlaces
  • Texto Completo Ejemplar
• Referencias bibliográficas
  • [1] Aragón Artacho, F.J., Borwein, J.M. and Tam, M.K. (2014). Douglas--Rachford feasibility methods por matrix completion problems.ANZIAM...
  • [2] Aragón Artacho, F.J., Borwein, J.M. and Tam, M.K. (2014). Recent resultson Douglas--Rachford methods for combinatorial optimization problems.J.Optim....
  • [3] Aragón Artacho, F.J. Borwein, J.M. and Tam, M.K. (2016). Global behav-ior of the Douglas--Rachford method for a nonconvex feasibility...
  • [4] Aragón Artacho, F.J. and Campoy, R. (2018). Solving graph coloring prob-lems with the Douglas--Rachford algorithm.Set-Valued Var. Anal.26(2),277–304.
  • [5] Aragón Artacho, F.J., Campoy, R. and Elser, V. (2018). An enhanced for-mulation for solving graph coloring problems with the Douglas--Rachfordalgorithm....
  • [6] Aragón Artacho, F.J., Censor, Y. and Gibali, A. (2018). The cyclic Douglas--Rachford algorithm withr-sets-Douglas--Rachford operators.OptimizationMethods...
  • [7] Baillon, J.B., Bruck, R.E. and Reich, S. (1978). On the asymptotic behaviorof nonexpansive mappings and semigroups in Banach spaces.Houston...
  • [8] Bauschke, H.H. and Combettes, P.L. (2017).Convex Analysis and MonotoneOperator Theory in Hilbert Spaces, 2nd edition, Springer, New York.
  • [9] Bauschke, H.H., Combettes, P.L. and Luke, D.R. (2004). Finding best ap-proximation pairs relative to two closed convex sets in Hilbert...
  • [10] Bauschke, H.H. and Koch, V.R. (2015). Projection methods: Swiss armyknives for solving feasibility and best approximation problems with...
  • [11] Bauschke, H.H. and Noll, D. (2014). On the local convergence of theDouglas--Rachford algorithm.Arch. Math.102(6), 589–600.
  • [12] Benoist, J. (2015). The Douglas--Rachford algorithm for the case of thesphere and the line.J. Global Optim.63(2), 363–380.
  • [13] Borwein, J.M. and Tam, M.K. (2014). A cyclic Douglas--Rachford iterationscheme.J. Optim. Theory Appl.160(1), 1–29.
  • [14] Douglas, J. and Rachford, H.H. (1956). On the numerical solution of heatconduction problems in two and three space variables.Trans. Amer....
  • [15] Elser, V., Rankenburg, I. and Thibault, P. (2007). Searching with iteratedmaps.Proc. Natl. Acad. Sci.104(2), 418–423.
  • [16] Escalante, R. and Raydan, M. (2011).Alternating Projection Methods. Fun-damentals of Algorithms8, Society for Industrial and Applied...
  • [17] Goebel, K. and Kirk, W.A. (1990).Topics in Metric Fixed Point Theory,Cambridge University Press, Cambridge.
  • [18] Hesse, R. and Luke, D.R. (2013). Nonconvex notions of regularity andconvergence of fundamental algorithms for feasibility problems.SIAM...
  • [19] Lions, P.L. and Mercier, B. (1979). Splitting algorithms for the sum of twononlinear operators.SIAM J. Numer. Anal.16(6), 964–979.
  • [20] Opial, Z. (1967). Weak convergence of the sequence of successive approxi-mations for nonexpansive mappings.Bull. Amer. Math. Soc.73(4),...
  • [21] Phan, H.M. (2016). Linear convergence of the Douglas--Rachford methodfor two closed sets.Optim.65(2), 369–385.
  • [22] Pierra, G. (1984). Decomposition through formalization in a product space.Math. Program.28(2), 96–115.
  • [23] Schaad, J. (2010).Modelling the 8-queens problem and Sudoku using analgorithm based on projections onto nonconvex sets. Masters’s thesis,...
  • [24] Segura Martínez, P. (2017).Resolución de cuadrados mágicos con el algo-ritmo de Douglas--Rachford. Final year undergraduate project,...
  • [25] Svaiter, B.F. (2011). On weak convergence of the Douglas--Rachfordmethod.SIAM J. Control Optim.49(1), 280–287.
  • [26] Swetz, F.J. (2008).Legacy of the Luoshu: The 4,000 Year Search for theMeaning of the Magic Square of Order Three, A K Peters, Ltd., Wellesley,Massachusetts.
  • [27] Taylor, G. (2003). A secret message in Dürer’s magic square?Notes in theHistory of Art.23(1), 17–22