The Alternating Algorithm in Uniformly Convex Spaces

DOI10.1112/JLMS/S2-29.3.545zbMath0561.41030OpenAlexW2036017609MaRDI QIDQ5186131

Carlo Franchetti, William A. Light

Publication date: 1984

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-29.3.545

zbMATH Keywords

proximinal subspacesalternating algorithmproximinal maps

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Duality and reflexivity in normed linear and Banach spaces (46B10)

Related Items (12)

Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces ⋮ Unrestricted iterations of nonexpansive mappings in Hilbert space ⋮ The Chebyshev solution of certain matrix equations ⋮ A variational approach to the alternating projections method ⋮ Random Products of Contractions in Banach Spaces ⋮ Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains. III. ⋮ Products of conditional expectation operators: convergence and divergence ⋮ Unrestricted iterations of nonexpansive mappings in Banach spaces ⋮ Strong CHIP, normality, and linear regularity of convex sets ⋮ A remark on the alternating algorithm ⋮ The product of affine orthogonal projections ⋮ On the unrestricted iteration of projections in Hilbert space

This page was built for publication: The Alternating Algorithm in Uniformly Convex Spaces