Several solution methods for the split feasibility problem

This publication has 10 references indexed in Scilit:

• The relaxed CQ algorithm solving the split feasibility problem
  Inverse Problems, 2004
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
  Inverse Problems, 2003
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces
  Journal of Approximation Theory, 2003
• Iterative oblique projection onto convex sets and the split feasibility problem
  Inverse Problems, 2002
• Inexact implicit methods for monotone general variational inequalities
  Mathematical Programming, 1999
• Numerical Optimization
  1999
• A Logarithmic-Quadratic Proximal Method for Variational Inequalities
  Computational Optimization and Applications, 1999
• On Projection Algorithms for Solving Convex Feasibility Problems
  SIAM Review, 1996
• A multiprojection algorithm using Bregman projections in a product space
  Numerical Algorithms, 1994
• Isometries for the Legendre-Fenchel transform
  Transactions of the American Mathematical Society, 1986