Projection Algorithms: Results and Open Problems

[1]  Heinz H. Bauschke,et al.  Accelerating the convergence of the method of alternating projections , 2003 .

[2]  F. Deutsch.  Best approximation in inner product spaces , 2001 .

[3]  P. L. Combettes,et al.  Quasi-Fejérian Analysis of Some Optimization Algorithms , 2001 .

[4]  Paul Tseng,et al.  Bounded Linear Regularity, Strong CHIP, and CHIP are Distinct Properties , 2000 .

[5]  Heinz H. Bauschke,et al.  Conical open mapping theorems and regularity , 1999 .

[6]  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..

[7]  P. L. Combettes,et al.  Hilbertian convex feasibility problem: Convergence of projection methods , 1997 .

[8]  Krzysztof C. Kiwiel,et al.  Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings , 1997, SIAM J. Optim..

[9]  Yair Censor,et al.  Recent Developments in Optimization Theory and Nonlinear Analysis: Ams/Imu Special Session on Optimization and Nonlinear Analysis, May 24-26, 1995, Jerusalem, Israel , 1997 .

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

[11]  Heinz H. Bauschke,et al.  Projection algorithms and monotone operators , 1996 .

[12]  Heinz H. Bauschke.  A norm convergence result on random products of relaxed projections in Hilbert space , 1995 .

[13]  K. Kiwiel.  Block-iterative surrogate projection methods for convex feasibility problems , 1995 .

[14]  Heinz H. Bauschke,et al.  Dykstra's Alternating Projection Algorithm for Two Sets , 1994 .

[15]  Heinz H. Bauschke,et al.  On the convergence of von Neumann's alternating projection algorithm for two sets , 1993 .

[16]  S. Reich,et al.  Unrestricted iterations of nonexpansive mappings in Hilbert space , 1992 .

[17]  Frank Deutsch,et al.  The Method of Alternating Orthogonal Projections , 1992 .

[18]  S. Reich,et al.  Random products of contractions in Banach spaces , 1991 .

[19]  Achiya Dax,et al.  Line search acceleration of iterative methods , 1990 .

[20]  W. B. Bearhart,et al.  Acceleration schemes for the method of alternating projections , 1989 .

[21]  R. Dykstra,et al.  A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces , 1986 .

[22]  Simeon Reich,et al.  A limit theorem for projections , 1983 .

[23]  R. Duffin,et al.  Series and parallel addition of matrices , 1969 .

[24]  Boris Polyak,et al.  The method of projections for finding the common point of convex sets , 1967 .

[25]  Yu. I. Merzlyakov.  On a relaxation method of solving systems of linear inequalities , 1963 .

[26]  A. Hoffman.  On approximate solutions of systems of linear inequalities , 1952 .