Linear Convergence of Projection Algorithms

References

• [1] Bauschke HH, Borwein JM (1996) On projections algorithms for solving convex feasibility problems. SIAM Rev. 38(3):367–426.Crossref, Google Scholar
• [2] Bauschke HH, Combettes PL (2011) Convex Analysis and Monotone Operator Theory in Hilbert Spaces (Springer, New York).Crossref, Google Scholar
• [3] Bauschke HH, Dao MN (2017) On the finite convergence of the Douglas–Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces. SIAM J. Optim. 27(1):507–537.Crossref, Google Scholar
• [4] Bauschke HH, Koch VR (2015) Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces. Reich S, Zaslavski AJ, eds. Infinite Products of Operators and Their Applications (American Mathematics Society, Providence, RI), 1–40.Crossref, Google Scholar
• [5] Bauschke HH, Kruk SG (2004) Reflection-projection method for convex feasibility problems with an obtuse cone. J. Optim. Theory Appl. 120(3):503–531.Crossref, Google Scholar
• [6] Bauschke HH, Borwein JM, Li W (1999) Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization. Math. Programming 86(1):135–160.Crossref, Google Scholar
• [7] Bauschke HH, Dao MN, Moursi WM (2016) The Douglas–Rachford algorithm in the affine-convex case. Oper. Res. Lett. 44(3):379–382.Crossref, Google Scholar
• [8] Bauschke HH, Iorio F, Koch VR (2014) The method of cyclic intrepid projections: Convergence analysis and numerical experiments. Wakayama M, Anderssen RS, Cheng J, Fukumoto Y, McKibbin R, Polthier K, Takagi T, Toh K-C, eds. The Impact of Applications on Mathematics (Springer, Tokyo), 187–200.Crossref, Google Scholar
• [9] Bauschke HH, Noll D, Phan HM (2015) Linear and strong convergence of algorithms involving averaged nonexpansive operators. J. Math. Anal. Appl. 421(1):1–20.Crossref, Google Scholar
• [10] Bauschke HH, Phan HM, Wang X (2014) The method of alternating relaxed projections for two nonconvex sets. Vietnam J. Math. 42(4):421–450.Crossref, Google Scholar
• [11] Bauschke HH, Dao MN, Noll D, Phan HM (2016) Proximal point algorithm, Douglas–Rachford algorithm and alternating projections: A case study. J. Convex Anal. 23(1):237–261.Google Scholar
• [12] Bauschke HH, Dao MN, Noll D, Phan HM (2016) On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces. J. Global Optim. 65(2):329–349.Crossref, Google Scholar
• [13] Bauschke HH, Luke DR, Phan HM, Wang X (2013) Restricted normal cones and the method of alternating projections: Theory. Set-Valued Var. Anal. 21(3):431–473.Crossref, Google Scholar
• [14] Bauschke HH, Luke DR, Phan HM, Wang X (2013) Restricted normal cones and the method of alternating projections: Applications. Set-Valued Var. Anal. 21(3):475–501.Crossref, Google Scholar
• [15] Borwein JM, Tam MK (2014) A cyclic Douglas–Rachford iteration scheme. J. Optim. Theory Appl. 160(1):1–29.Crossref, Google Scholar
• [16] Borwein JM, Li G, Tam MK (2017) Convergence rate analysis for averaged fixed point iterations in common fixed point problems. SIAM J. Optim. 27(1):1–33.Crossref, Google Scholar
• [17] Bregman LM (1965) The method of successive projection for finding a common point of convex sets. Soviet Math. Dokl. 6:688–692.Google Scholar
• [18] Cegielski A (2012) Iterative Methods for Fixed Point Problems in Hilbert Spaces (Springer, Heidelberg, Germany).Crossref, Google Scholar
• [19] Douglas J, Rachford HH (1956) On the numerical solution of heat conduction problems in two and three space variables. Trans. Amer. Math. Soc. 82(2):421–439.Crossref, Google Scholar
• [20] Drusvyatskiy D, Ioffe AD, Lewis AS (2015) Transversality and alternating projections for nonconvex sets. Found. Comput. Math. 15(6):1637–1651.Crossref, Google Scholar
• [21] Goffin JL (1980) The relaxation method for solving systems of linear inequalities. Math. Oper. Res. 5(3):388–414.Link, Google Scholar
• [22] Herman G (1975) A relaxation method for reconstructing objects from noisy X-rays. Math. Programming 8(1):1–19.Crossref, Google Scholar
• [23] Herman G, Chen W (2008) A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy. Linear Algebra Appl. 428(5–6):1207–1217.Crossref, Google Scholar
• [24] Hesse R, Luke DR (2013) Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. SIAM J. Optim. 23(4):2397–2419.Crossref, Google Scholar
• [25] Ioffe AD (1989) Approximate subdifferentials and applications 3: The metric theory. Mathematika 36(1):1–38.Crossref, Google Scholar
• [26] Kruger AY (2006) About regularity of collections of sets. Set-Valued Anal. 14(2):187–206.Crossref, Google Scholar
• [27] Kruger AY, Luke DR, Thao NH (2017) About subtransversality of collections of sets. Set-Valued Anal. 25(4):701–729.Crossref, Google Scholar
• [28] Lewis AS, Luke DR, Malick J (2009) Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 9(4):485–513.Crossref, Google Scholar
• [29] Lions PL, Mercier B (1979) Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6):964–979.Crossref, Google Scholar
• [30] Luke DR, Thao NH, Tam MK (2018) Quantitative convergence analysis of iterated expansive, set-valued mappings. Math. Oper. Res. 43(4):1143–1176.Google Scholar
• [31] Mordukhovich BS (2006) Variational Analysis and Generalized Differentiation I (Springer, Berlin).Crossref, Google Scholar
• [32] Ngai HV, Théra M (2001) Metric inequality, subdifferential calculus and applications. Set-Valued Anal. 9(1–2):187–216.Crossref, Google Scholar
• [33] Noll D, Rondepierre A (2016) On local convergence of the method of alternating projections. Found. Comput. Math. 16(2):425–455.Crossref, Google Scholar
• [34] Phan HM (2016) Linear convergence of the Douglas–Rachford method for two closed sets. Optimization 65(2):369–385.Crossref, Google Scholar
• [35] Rockafellar RT, Wets RJB (1998) Variational Analysis (Springer, Berlin).Crossref, Google Scholar