On projection algorithms for solving convex feasibility problems. (English) Zbl 0865.47039

Bauschke, Heinz H.; Borwein, Jonathan M.

SIAM Rev. 38, No. 3, 367-426 (1996).

MSC:

47H09	Contraction-type mappings, nonexpansive mappings, \(A\)-proper mappings, etc.
90C25	Convex programming
65J10	Numerical solutions to equations with linear operators
92C55	Biomedical imaging and signal processing

Keywords:

angle between two subspaces; averaged mapping; Cimmino’s method; convex inequalities; convex programming; convex set; Fejér monotone sequence; firmly nonexpansive mapping; image recovery; Kaczmarz’s method; nonexpansive mapping; orthogonal projection; Slater point; subdifferential; subgradient algorithm; successive projections; computerized tomography; convex feasibility problems; quality of convergence