Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems

This publication has 29 references indexed in Scilit:

• 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
• 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
• Generalized Image Restoration by the Method of Alternating Orthogonal Projections
  IEEE Transactions on Circuits and Systems, 1978
• Another Proof that Convex Functions are Locally Lipschitz
  The American Mathematical Monthly, 1974
• The method of projections for finding the common point of convex sets
  USSR Computational Mathematics and Mathematical Physics, 1967
• The Relaxation Method for Linear Inequalities
  Canadian Journal of Mathematics, 1954
• The Relaxation Method for Linear Inequalities
  Canadian Journal of Mathematics, 1954
• On Rings of Operators. Reduction Theory
  Annals of Mathematics, 1949