Relaxed outer projections, weighted averages and convex feasibility
- 1 June 1990
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 30 (2) , 289-300
- https://doi.org/10.1007/bf02017349
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problemsLinear Algebra and its Applications, 1989
- Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equationsJournal of Computational and Applied Mathematics, 1986
- Convergence results for an accelerated nonlinear cimmino algorithmNumerische Mathematik, 1986
- A primal-dual projection method for solving systems of linear inequalitiesLinear Algebra and its Applications, 1985
- A simultaneous projections method for linear inequalitiesLinear Algebra and its Applications, 1985
- An interior points algorithm for the convex feasibility problemAdvances in Applied Mathematics, 1983
- Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraintsJournal of Approximation Theory, 1975
- 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
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954