The Convergence of an Algorithm for Finding the Distance between a Ball in a Subspace and a Sum of Subspaces

DOI10.1137/0727078zbMATH Open0712.65041OpenAlexW1970432621MaRDI QIDQ3197209

Yaacov Ritov

Publication date: 1990

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0727078

zbMATH Keywords

convergenceHilbert spacealternating projection algorithmdistance between a ball in a subspace and a sum of subspacesminimal angle between subspaces

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05)

Related Items (1)

The alternating algorithm in a uniformly convex and uniformly smooth Banach space

This page was built for publication: The Convergence of an Algorithm for Finding the Distance between a Ball in a Subspace and a Sum of Subspaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197209)