Linear convergence of the randomized sparse Kaczmarz method

This publication has 46 references indexed in Scilit:

• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
  Mathematical Programming, 2012
• Randomized Kaczmarz solver for noisy linear systems
  BIT Numerical Mathematics, 2010
• Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
  Mathematics of Computation, 2009
• An iterative regularization method for the solution of the split feasibility problem in Banach spaces
  Inverse Problems, 2008
• Decoding by Linear Programming
  IEEE Transactions on Information Theory, 2005
• The multiple-sets split feasibility problem and its applications for inverse problems
  Inverse Problems, 2005
• Several solution methods for the split feasibility problem
  Inverse Problems, 2005
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
  Inverse Problems, 2003
• Iterative oblique projection onto convex sets and the split feasibility problem
  Inverse Problems, 2002
• Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
  Mathematical Programming, 1999