On the convergence of von Neumann's alternating projection algorithm for two sets
- 1 January 1993
- journal article
- research article
- Published by Springer Science and Business Media LLC in Set-Valued Analysis
- Vol. 1 (2), 185-212
- https://doi.org/10.1007/bf01027691
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Dykstra′s Alternating Projection Algorithm for Two SetsJournal of Approximation Theory, 1994
- Partially finite convex programming, Part I: Quasi relative interiors and duality theoryMathematical Programming, 1992
- Partially finite convex programming, Part II: Explicit lattice modelsMathematical Programming, 1992
- The Method of Alternating Orthogonal ProjectionsPublished by Springer Science and Business Media LLC ,1992
- On the von Neumann alternating algorithm in Hilbert spaceJournal of Mathematical Analysis and Applications, 1986
- Stability and regular points of inequality systemsJournal of Optimization Theory and Applications, 1986
- Absolute norms on vector latticesProceedings of the Edinburgh Mathematical Society, 1984
- The method of projections for finding the common point of convex setsUSSR Computational Mathematics and Mathematical Physics, 1967
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- On certain inequalities and characteristic value problems for analytic functions and for functions of two variablesTransactions of the American Mathematical Society, 1937