Hilbertian convex feasibility problem: Convergence of projection methods
- 1 May 1997
- journal article
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 35 (3) , 311-330
- https://doi.org/10.1007/bf02683333
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Convergence of Bregman Projection Methods for Solving Consistent Convex Feasibility Problems in Reflexive Banach SpacesJournal of Optimization Theory and Applications, 1997
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- A norm convergence result on random products of relaxed projections in Hilbert spaceTransactions of the American Mathematical Society, 1995
- Strong convergence of expected-projection methods in hilbert spacesNumerical Functional Analysis and Optimization, 1995
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problemsLinear Algebra and its Applications, 1989
- An interior points algorithm for the convex feasibility problemAdvances in Applied Mathematics, 1983
- Random products of contractions in metric and Banach SpacesJournal of Mathematical Analysis and Applications, 1982
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981
- Convergence theorems for sequences of nonlinear operators in Banach spacesMathematische Zeitschrift, 1967
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954