Linear Convergence of Projection Algorithms

Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we study linear convergence of several projection algorithms for systems of finitely many closed sets. The results complement contemporary research on the same topic.

[1]  Heinz H. Bauschke,et al.  Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study , 2015, 1501.06603.

[2]  Heinz H. Bauschke,et al.  Restricted Normal Cones and the Method of Alternating Projections: Applications , 2012, 1205.0318.

[3]  Heinz H. Bauschke,et al.  Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone , 2004 .

[4]  Jean-Louis Goffin,et al.  The Relaxation Method for Solving Systems of Linear Inequalities , 1980, Math. Oper. Res..

[5]  F. Giannessi.  Variational Analysis and Generalized Differentiation , 2006 .

[6]  Dmitriy Drusvyatskiy,et al.  Transversality and Alternating Projections for Nonconvex Sets , 2014, Found. Comput. Math..

[7]  Heinz H. Bauschke,et al.  On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces , 2016, J. Glob. Optim..

[8]  A. Kruger.  About Regularity of Collections of Sets , 2006 .

[9]  Heinz H. Bauschke,et al.  Linear and strong convergence of algorithms involving averaged nonexpansive operators , 2014, Journal of Mathematical Analysis and Applications.

[10]  Heinz H. Bauschke,et al.  The Method of Alternating Relaxed Projections for Two Nonconvex Sets , 2013, Vietnam Journal of Mathematics.

[11]  Aude Rondepierre,et al.  On Local Convergence of the Method of Alternating Projections , 2013, Foundations of Computational Mathematics.

[12]  Wei Chen,et al.  A fast algorithm for solving a linear feasibility problem with application to Intensity-Modulated Radiation Therapy. , 2008, Linear algebra and its applications.

[13]  Heinz H. Bauschke,et al.  Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization , 1999, Math. Program..

[14]  Heinz H. Bauschke,et al.  The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments , 2013, 1312.0534.

[15]  Adrian S. Lewis,et al.  Local Linear Convergence for Alternating and Averaged Nonconvex Projections , 2009, Found. Comput. Math..

[16]  Gabor T. Herman,et al.  A relaxation method for reconstructing objects from noisy X-rays , 1975, Math. Program..

[17]  Heinz H. Bauschke,et al.  Restricted Normal Cones and the Method of Alternating Projections: Theory , 2012 .

[18]  Jonathan M. Borwein,et al.  A Cyclic Douglas–Rachford Iteration Scheme , 2013, J. Optim. Theory Appl..

[19]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..

[20]  P. Lions,et al.  Splitting Algorithms for the Sum of Two Nonlinear Operators , 1979 .

[21]  Heinz H. Bauschke,et al.  Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces , 2013, 1301.4506.

[22]  D. Russell Luke,et al.  Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems , 2012, SIAM J. Optim..

[23]  A. Cegielski.  Iterative Methods for Fixed Point Problems in Hilbert Spaces , 2012 .

[24]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[25]  Jonathan M. Borwein,et al.  Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems , 2015, SIAM J. Optim..

[26]  A. Ioffe.  Approximate subdifferentials and applications 3: the metric theory , 1989 .

[27]  Alexander Y. Kruger,et al.  About Subtransversality of Collections of Sets , 2016 .

[28]  Heinz H. Bauschke,et al.  On the Finite Convergence of the Douglas-Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces , 2017, SIAM J. Optim..

[29]  Hung M. Phan,et al.  Linear convergence of the Douglas–Rachford method for two closed sets , 2014, 1401.6509.

[30]  H. H. Rachford,et al.  On the numerical solution of heat conduction problems in two and three space variables , 1956 .

[31]  D. Russell Luke,et al.  Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings , 2016, Math. Oper. Res..