Projection onto an acute cone and convex feasibility problem

This publication has 10 references indexed in Scilit:

• A general iterative scheme with applications to convex optimization and related fields
  Optimization, 1991
• Relaxed outer projections, weighted averages and convex feasibility
  BIT Numerical Mathematics, 1990
• On the behavior of a block-iterative projection method for solving convex feasibility problems
  International Journal of Computer Mathematics, 1990
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
  Linear Algebra and its Applications, 1989
• Convergence results for an accelerated nonlinear cimmino algorithm
  Numerische Mathematik, 1986
• Decomposition through formalization in a product space
  Mathematical Programming, 1984
• The Relaxation Method for Solving Systems of Linear Inequalities
  Mathematics of Operations Research, 1980
• Minimization of unsmooth functionals
  USSR Computational Mathematics and Mathematical Physics, 1969
• The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
  USSR Computational Mathematics and Mathematical Physics, 1967
• The Relaxation Method for Linear Inequalities
  Canadian Journal of Mathematics, 1954