Block-iterative surrogate projection methods for convex feasibility problems

This publication has 34 references indexed in Scilit:

• Relaxed outer projections, weighted averages and convex feasibility
  BIT Numerical Mathematics, 1990
• A class of methods for solving large convex systems
  Operations Research Letters, 1990
• On the behavior of a block-iterative projection method for solving convex feasibility problems
  International Journal of Computer Mathematics, 1990
• A parallel subgradient projections method for the convex feasibility problem
  Journal of Computational and Applied Mathematics, 1987
• Convergence results for an accelerated nonlinear cimmino algorithm
  Numerische Mathematik, 1986
• An interior points algorithm for the convex feasibility problem
  Advances in Applied Mathematics, 1983
• On relaxation methods for systems of linear inequalities
  European Journal of Operational Research, 1982
• Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
  Journal of Approximation Theory, 1975
• The Relaxation Method for Linear Inequalities
  Canadian Journal of Mathematics, 1954
• The Relaxation Method for Linear Inequalities
  Canadian Journal of Mathematics, 1954